A fast algorithm for constructing Delaunay triangulations in the plane
- 1 January 1987
- journal article
- Published by Elsevier in Advances in Engineering Software (1978)
- Vol. 9 (1) , 34-55
- https://doi.org/10.1016/0141-1195(87)90043-x
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Algorithm 624: Triangulation and Interpolation at Arbitrarily Distributed Points in the PlaneACM Transactions on Mathematical Software, 1984
- An implementation of Watson's algorithm for computing 2-dimensional delaunay triangulationsAdvances in Engineering Software (1978), 1984
- Technical note: Efficient sorting routines in FORTRAN 77Advances in Engineering Software (1978), 1984
- A storage-efficient method for construction of a Thiessen triangulationRocky Mountain Journal of 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
- Computing Dirichlet Tessellations in the PlaneThe Computer Journal, 1978
- Locally equiangular triangulationsThe Computer Journal, 1978