Title :
Efficient VLSI parallel algorithm for Delaunay triangulation on orthogonal tree network in two and three dimensions
Author :
Saxena, Sanjeev ; Bhatt, P.C.P. ; Prasad, V.C.
Author_Institution :
Indian Inst. of Technol., Delhi, India
fDate :
3/1/1990 12:00:00 AM
Abstract :
An algorithm with worst case time complexity O(log2 N) in two dimensions and O(m1/2 log N) in three dimensions with N input points and m as the number of tetrahedra in triangulation is given. Its AT2 VLSI complexity on Thompson´s logarithmic delay model, (1983) is O(N2log6 N) in two dimensions and O(m2N log4 N) in three dimensions
Keywords :
computational complexity; parallel algorithms; trees (mathematics); Delaunay triangulation; VLSI parallel algorithm; logarithmic delay model; orthogonal tree network; tetrahedra; worst case time complexity; Biology computing; Computational geometry; Delay; Finite element methods; Intelligent networks; Parallel algorithms; Parallel processing; Shape; Solid modeling; Very large scale integration;
Journal_Title :
Computers, IEEE Transactions on
