Higher-dimensional voronoi diagrams in linear expected time
- 1 September 1991
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 6 (3) , 343-367
- https://doi.org/10.1007/bf02574694
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Random spheres in a convex bodyArchiv der Mathematik, 1990
- On the convex hull of random points in a polytopeJournal of Applied Probability, 1988
- A faster divide-and-conquer algorithm for constructing delaunay triangulationsAlgorithmica, 1987
- Finding the convex hull facet by facetJournal of Algorithms, 1985
- 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
- Optimal Expected-Time Algorithms for Closest Point ProblemsACM Transactions on Mathematical Software, 1980
- Isotropic random simplicesAdvances in Applied Probability, 1971
- The convex hull of a random set of pointsBiometrika, 1965
- 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