Improvements on Sloan's algorithm for constructing Delaunay triangulations
- 1 March 1998
- journal article
- Published by Elsevier in Computers & Geosciences
- Vol. 24 (2) , 193-196
- https://doi.org/10.1016/s0098-3004(97)00136-2
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- An efficient algorith for determining the convex hull of a finite planar setPublished by Elsevier ,2002
- Fast topological construction of delaunay triangulations and voronoi diagramsComputers & Geosciences, 1993
- Voronoi diagrams—a survey of a fundamental geometric data structureACM Computing Surveys, 1991
- A fast algorithm for constructing Delaunay triangulations in the planeAdvances in Engineering Software (1978), 1987
- Primitives for the manipulation of general subdivisions and the computation of VoronoiACM Transactions on Graphics, 1985
- Computational GeometryPublished by Springer Nature ,1985
- Computational Geometry—A SurveyIEEE Transactions on Computers, 1984