Computational geometry: an introduction
Computational geometry: an introduction
Implementing Watson's algorithm in three dimensions
SCG '86 Proceedings of the second annual symposium on Computational geometry
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
An O(log n) time parallel algorithm for triangulating a set of points in the plane
Information Processing Letters
Parallel processing for efficient subdivision search
SCG '87 Proceedings of the third annual symposium on Computational geometry
Primitives for the manipulation of general subdivisions and the computation of Voronoi
ACM Transactions on Graphics (TOG)
Geometric structures for three-dimensional shape representation
ACM Transactions on Graphics (TOG)
Structure of Computers and Computations
Structure of Computers and Computations
Parallel algorithms for geometric problems
Parallel algorithms for geometric problems
A data-parallel algorithm for three-dimensional Delaunay triangulation and its implementation
Proceedings of the 1993 ACM/IEEE conference on Supercomputing
Parallel 2D Delaunay Triangulations in HPF and MPI
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Efficient parallel geometric algorithms on a mesh of trees
ACM-SE 33 Proceedings of the 33rd annual on Southeast regional conference
| Hi-index | 14.99 |
An algorithm with worst case time complexity O(log/sup 2/N) in two dimensions and O(m/sup 1/2/log N) in three dimensions with N input points and m as the number of tetrahedra in triangulation is given. Its AT/sup 2/ VLSI complexity on Thompson's logarithmic delay model, (1983) is O(N/sup 2/log/sup 6/N) in two dimensions and O(m/sup 2/Nlog/sup 4/ N) in three dimensions.