On the average length of Delaunay triangulations
- 1 September 1984
- journal article
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 24 (3) , 269-273
- https://doi.org/10.1007/bf02136025
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Two algorithms for constructing a Delaunay triangulationInternational Journal of Parallel Programming, 1980
- A note on Delaunay and optimal triangulationsInformation Processing Letters, 1980
- Multidimensional divide-and-conquerCommunications of the ACM, 1980
- Neither the greedy nor the delaunay triangulation of a planar point set approximates the optimal triangulationInformation Processing Letters, 1979
- On triangulations of a set of points in the planePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1977
- Closest-point problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1975
- On the homogeneous planar Poisson point processMathematical Biosciences, 1970
- Stochastic Point Processes: Limit TheoremsThe Annals of Mathematical Statistics, 1967
- A Lower Bound for the Expected Travel Among $m$ Random PointsThe Annals of Mathematical Statistics, 1948
- 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