Fast topological construction of delaunay triangulations and voronoi diagrams
- 1 November 1993
- journal article
- Published by Elsevier in Computers & Geosciences
- Vol. 19 (10) , 1463-1474
- https://doi.org/10.1016/0098-3004(93)90062-a
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Voronoi diagrams—a survey of a fundamental geometric data structureACM Computing Surveys, 1991
- A faster divide-and-conquer algorithm for constructing delaunay triangulationsAlgorithmica, 1987
- Delaunay triangulation and the convex hull ofn points in expected linear timeBIT Numerical Mathematics, 1984
- Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopesThe Computer Journal, 1981
- Computing Dirichlet tessellationsThe Computer Journal, 1981
- Two algorithms for constructing a Delaunay triangulationInternational Journal of Parallel Programming, 1980
- A Procedure to Generate Thiessen PolygonsGeographical Analysis, 1979
- Locally equiangular triangulationsThe Computer Journal, 1978
- Nouvelles applications des paramètres continus à la théorie des formes quadratiques. Deuxième mémoire. Recherches sur les parallélloèdres primitifs.Journal für die reine und angewandte Mathematik (Crelles Journal), 1908
- Über die Reduction der positiven quadratischen Formen mit drei unbestimmten ganzen Zahlen.Journal für die reine und angewandte Mathematik (Crelles Journal), 1850