Efficient VLSI parallel algorithm for Delaunay triangulation onorthogonal tree network in two and three dimensions
Saxena, S.; Bhatt, P.C.P.; Prasad, V.C.
Computers, IEEE Transactions on
Volume 39, Issue 3, Mar 1990 Page(s):400 - 404
Digital Object Identifier   10.1109/12.48871
Summary:An algorithm with worst case time complexity O(log² N) in two dimensions and O(m^1/2 log N) in three dimensions with N input points and m as the number of tetrahedra in triangulation is given. Its AT² VLSI complexity on Thompson's logarithmic delay model, (1983) is O(N²log⁶ N) in two dimensions and O(m²N log⁴ N) in three dimensions

» View citation and abstract

Log in by entering your IEEE Web Account Username and Password.

IEEE Communications Society members: If you subscribe to the IEEE Electronic Periodicals Package or IEEE Electronic Periodicals Package Plus, you must access your subscription at www.comsoc.org.

Check with your librarian, information professional, or system manager to determine if you need to log in. Please complete the online Technical Support Form if you need assistance.

Select the Purchase History link to access the document. You will have 5 Days after purchase to access the Full Text PDF. Please complete the online Technical Support Form if you need assistance.

• Search and access Abstract records free of charge
• Register for table of contents alerts
• Purchase Full Text PDF documents

» Learn more about subscription options or how to become an IEEE Member.