The expected number of \(k\)-faces of a Voronoi diagram

DOI10.1016/0898-1221(93)90068-7zbMath0781.60015OpenAlexW2000332739MaRDI QIDQ1309732

Rex A. Dwyer

Publication date: 8 February 1994

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(93)90068-7

zbMATH Keywords

Voronoi diagramNumerical estimatesasymptotic behavior of the expected number of faces

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Special polytopes (linear programming, centrally symmetric, etc.) (52B12)

Related Items (7)

On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes ⋮ Complexity of the Delaunay triangulation of points on polyhedral surfaces ⋮ Unnamed Item ⋮ Delaunay-based derivative-free optimization via global surrogates. I: Linear constraints ⋮ Delaunay-based derivative-free optimization via global surrogates. II: Convex constraints ⋮ Randomized incremental construction of Delaunay triangulations of nice point sets ⋮ Bounds on the geometric complexity of optimal centroidal Voronoi tesselations in 3D

Uses Software

• Mathematica

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Higher-dimensional Voronoi diagrams in linear expected time
• The expected size of some graphs in computational geometry
• Random spheres in a convex body
• Isotropic random simplices

This page was built for publication: The expected number of \(k\)-faces of a Voronoi diagram