Delaunay triangulation and the convex hull ofn points in expected linear time
- 1 June 1984
- journal article
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 24 (2) , 151-163
- https://doi.org/10.1007/bf01937482
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- An efficient algorith for determining the convex hull of a finite planar setPublished by Elsevier ,2002
- Improved planarity algorithmsBIT Numerical Mathematics, 1982
- Delaunay Triangulation of a Random Data Set for Isarithmic MappingThe Cartographic Journal, 1980
- Two-Dimensional Voronoi Diagrams in theLp-MetricJournal of the ACM, 1980
- A Procedure to Generate Thiessen PolygonsGeographical Analysis, 1979
- Computing Dirichlet Tessellations in the PlaneThe Computer Journal, 1978
- Locally equiangular triangulationsThe Computer Journal, 1978
- Modelling Spatial PatternsJournal of the Royal Statistical Society Series B: Statistical Methodology, 1977
- Closest-point problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1975