An almost distribution-independent incremental Delaunay triangulation algorithm
- 14 July 2005
- journal article
- research article
- Published by Springer Nature in The Visual Computer
- Vol. 21 (6) , 384-396
- https://doi.org/10.1007/s00371-005-0293-3
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Improvements to randomized incremental Delaunay insertionComputers & Graphics, 2002
- Improvements on Sloan's algorithm for constructing Delaunay triangulationsComputers & Geosciences, 1998
- Delaunay triangulation using a uniform gridIEEE Computer Graphics and Applications, 1993
- Algorithm for Delaunay triangulation and convex-hull computation using a sparse matrixComputer-Aided Design, 1992
- Randomized incremental construction of Delaunay and Voronoi diagramsAlgorithmica, 1992
- A sweepline algorithm for Voronoi diagramsAlgorithmica, 1987
- A faster divide-and-conquer algorithm for constructing delaunay triangulationsAlgorithmica, 1987
- Voronoi diagrams and arrangementsDiscrete & Computational Geometry, 1986
- Primitives for the manipulation of general subdivisions and the computation of VoronoiACM Transactions on Graphics, 1985
- Software for C1 Surface InterpolationPublished by Elsevier ,1977