Computational geometry: an introduction
Computational geometry: an introduction
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
Primitives for the manipulation of general subdivisions and the computation of Voronoi
ACM Transactions on Graphics (TOG)
Discrete Voronoi Diagrams and the SKIZ Operator: A Dynamic Algorithm
IEEE Transactions on Pattern Analysis and Machine Intelligence
Delaunay Triangulation in Three Dimensions
IEEE Computer Graphics and Applications
Parallel 2D Delaunay Triangulations in HPF and MPI
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Delaunay Surface Reconstruction from Scattered Points
DGCI '00 Proceedings of the 9th International Conference on Discrete Geometry for Computer Imagery
Multiscale Medial Loci and Their Properties
International Journal of Computer Vision - Special Issue on Research at the University of North Carolina Medical Image Display Analysis Group (MIDAG)
Automatic triangulation over three-dimensional parametric surfaces based on advancing front method
Finite Elements in Analysis and Design
An efficient sweep-line Delaunay triangulation algorithm
Computer-Aided Design
Automatic triangulation over three-dimensional parametric surfaces based on advancing front method
Finite Elements in Analysis and Design
Constrained delaunay triangulation using delaunay visibility
ISVC'06 Proceedings of the Second international conference on Advances in Visual Computing - Volume Part I
An efficient algorithm for clipping operation based on trapezoidal meshes and sweep-line technique
Advances in Engineering Software
The delaunay triangulation by grid subdivision
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part III
| Hi-index | 0.00 |
An algorithm for triangulating 2-D data points that is based on a uniform grid structure and a triangulation strategy that builds triangles in a circular fashion is discussed. The triangulation strategy lets the algorithm eliminate points from the internal data structure and decreases the time used to find points to form triangles, given an edge. The algorithm has a tested linear time complexity that significantly improves on that of other methods. As a by-product, the algorithm produces the convex hull of the data set at no extra cost. Two ways to compute the convex hull using the algorithm are presented. The first is based on the edge list and the second is based on the grid structure.