DeWall: A fast divide and conquer Delaunay triangulation algorithm in Ed
References (19)
- et al.
Geometric computing and uniform grid technique
Computer-Aided Design
(1989) Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Survey
(1991)- et al.
A comparison of sequential delaunay triangulation algorithms
Sur la sphere vide
Bull. Acad. Science USSR VII: Class. Sci. Mat. Nat.
(1934)- et al.
- et al.
Simulation of simpicity: a technique to cope with degenerate cases in geometric algorithms
ACM Transaction on Graphics
(1990) - et al.
How good are convex hull algorithms?
- et al.
Incremental topological flipping works for regula triangulaions
- et al.
Randomized incremental construction of Delaunay and voronoy diagrams
There are more references available in the full text version of this article.
Cited by (187)
An incremental algorithm for simultaneous construction of 2D Voronoi diagram and Delaunay triangulation based on a face-based data structure
2022, Advances in Engineering SoftwareCitation Excerpt :Based on these data structures, several algorithms are proposed for constructing the DT and the VD. Based on the classification of Su and Drysdale [26], the proposed algorithms are divided into different categories such as divide and conquer [6,14,27], incremental algorithms [10,28–32], Plane Sweep Algorithms [9,15,33]), Convex Hull Based Algorithms [34], Gift Wrapping Algorithms [35,36]. The algorithms proposed for constructing the DT and the VD are often complex in terms of implementation and programming.
The Delaunay triangulation learner and its ensembles
2020, Computational Statistics and Data AnalysisParallel computation of alpha complexes for biomolecules
2020, Computational Geometry: Theory and Applications
Copyright © 1998 Published by Elsevier Ltd.