A fast algorithm for constructing Delaunay triangulations in the plane
Advances in Engineering Software
Three-dimensional triangulations from local transformations
SIAM Journal on Scientific and Statistical Computing
Randomized multidimensional search trees (extended abstract): dynamic sampling
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Construction of three-dimensional Delaunay triangulations using local transformations
Computer Aided Geometric Design
Implementation of a randomized algorithm for Delaunay and regular triangulations in three dimensions
Computer Aided Geometric Design
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)
Nice point sets can have nasty Delaunay triangulations
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Dense point sets have sparse Delaunay triangulations: or "…but not too nasty"
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
| Hi-index | 0.00 |
The paper describes a modification of DAG-based location for incremental insertion Delaunay triangulation algorithm in E2 and E3. Instead of the whole simplices, only their separating faces are stored and tested. The proposed technique allows full reuse of results obtained on previous DAG levels. This enables to reduce time for point location and memory requirements. Asymptotic memory and time complexity is not changed.