A faster divide-and-conquer algorithm for constructing delaunay triangulations
- 1 November 1987
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 2 (1-4) , 137-151
- https://doi.org/10.1007/bf01840356
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Primitives for the manipulation of general subdivisions and the computation of VoronoiACM Transactions on Graphics, 1985
- Delaunay triangulation and the convex hull ofn points in expected linear timeBIT Numerical Mathematics, 1984
- Optimal Expected-Time Algorithms for Closest Point ProblemsACM Transactions on Mathematical Software, 1980
- Two-Dimensional Voronoi Diagrams in theLp-MetricJournal of the ACM, 1980
- Two algorithms for constructing a Delaunay triangulationInternational Journal of Parallel Programming, 1980
- Voronoui Diagrams in $L_1 (L_\infty )$ Metrics with 2-Dimensional Storage ApplicationsSIAM Journal on Computing, 1980
- An O ( n log n ) Algorithm for Rectilinear Minimal Spanning TreesJournal of the ACM, 1979
- Locally equiangular triangulationsThe Computer Journal, 1978
- Software for C1 Surface InterpolationPublished by Elsevier ,1977
- Two Dimensional Interpolation from Random DataThe Computer Journal, 1976