Two algorithms for constructing a Delaunay triangulation
- 1 June 1980
- journal article
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 9 (3), 219-242
- https://doi.org/10.1007/bf00977785
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- A triangulation algorithm for arbitrary planar domainsApplied Mathematical Modelling, 1978
- Triangulation of planar regions with applicationsThe Computer Journal, 1978
- Locally equiangular triangulationsThe Computer Journal, 1978
- Packing of congruent spheres in a stripActa Mathematica Hungarica, 1978
- Piecewise Quadratic Approximations on TrianglesACM Transactions on Mathematical Software, 1977
- Convex hulls of finite sets of points in two and three dimensionsCommunications of the ACM, 1977
- Analytic Delineation of Thiessen Polygons*Geographical Analysis, 1973
- Reconstructing Patterns from Sample DataThe Annals of Mathematical Statistics, 1967
- Random Subdivisions of Space into CrystalsThe Annals of Mathematical Statistics, 1962
- 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