Computational geometry: an introduction
Computational geometry: an introduction
Voronoi diagrams and arrangements
Discrete & Computational Geometry
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
A comparison of sequential Delaunay triangulation algorithms
Proceedings of the eleventh annual symposium on Computational geometry
Proceedings of the twelfth annual symposium on Computational geometry
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Improved incremental randomized Delaunay triangulation
Proceedings of the fourteenth annual symposium on Computational geometry
Primitives for the manipulation of general subdivisions and the computation of Voronoi
ACM Transactions on Graphics (TOG)
Triangulations in CGAL (extended abstract)
Proceedings of the sixteenth annual symposium on Computational geometry
Delaunay Triangulation Using a Uniform Grid
IEEE Computer Graphics and Applications
Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator
FCRC '96/WACG '96 Selected papers from the Workshop on Applied Computational Geormetry, Towards Geometric Engineering
Sweep-line algorithm for constrained Delaunay triangulation
International Journal of Geographical Information Science
A sweep-line algorithm for spatial clustering
Advances in Engineering Software
Eliminating contour line artefacts by using constrained edges
Computers & Geosciences
Medial axis of a planar region by offset self-intersections
Computer-Aided Design
Delaunay space division for RBF image reconstruction
Proceedings of the 26th Spring Conference on Computer Graphics
A faster circle-sweep Delaunay triangulation algorithm
Advances in Engineering Software
| Hi-index | 0.00 |
This paper introduces a new algorithm for constructing a 2D Delaunay triangulation. It is based on a sweep-line paradigm, which is combined with a local optimization criterion-a characteristic of incremental insertion algorithms. The sweep-line status is represented by a so-called advancing front, which is implemented as a hash-table. Heuristics have been introduced to prevent the construction of tiny triangles, which would probably be legalized. This algorithm has been compared with other popular Delaunay algorithms and it is the fastest algorithm among them. In addition, this algorithm does not use a lot of memory for supporting data structure, it is easy to understand and simple to implement.