The expected number of k-faces of a Voronoi diagram

DOI10.1016/0898-1221(93)90068-7MaRDI QIDQ1309732zbMATH OpenOpenAlexFDO

Authors 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

asymptotic behavior of the expected number of facesNumerical estimatesVoronoi diagram

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 17662
• On the Number of Vertices of Random Polyhedra with a Given Number of Facets
• On expected face numbers of random beta and beta' polytopes
• Convex hulls of random walks: expected number of faces and face probabilities
• Recurrence relationships for the mean number of faces and vertices for random convex hulls
• On the distribution of the number of vertices of a random polygon
• The probabilistic complexity of the Voronoi diagram of points on a polyhedron
• scientific article; zbMATH DE number 516161
• scientific article; zbMATH DE number 5763319
• Bounding the number of k-faces in arrangements of hyperplanes

Cites work

• Higher-dimensional Voronoi diagrams in linear expected time
• scientific article; zbMATH DE number 4098590 (Why is no real title available?)
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• scientific article; zbMATH DE number 3457880 (Why is no real title available?)
• scientific article; zbMATH DE number 3533716 (Why is no real title available?)
• Isotropic random simplices
• Random spheres in a convex body
• The expected size of some graphs in computational geometry

Cited in

(15)

• An upper bound on average touching number of a Voronoi partition
• Complexity of the Delaunay triangulation of points on polyhedral surfaces
• On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes
• Randomized incremental construction of Delaunay triangulations of nice point sets
• scientific article; zbMATH DE number 17662 (Why is no real title available?)
• The probabilistic complexity of the Voronoi diagram of points on a polyhedron
• Asymptotic properties of random Voronoi cells with arbitrary underlying density
• Randomized incremental construction of Delaunay triangulations of nice point sets
• Voronoi diagrams of random lines and flats
• Asymptotics of the quantization problem on metric measure spaces
• On the size of chromatic Delaunay mosaics
• Delaunay-based derivative-free optimization via global surrogates. I: Linear constraints
• Delaunay-based derivative-free optimization via global surrogates. II: Convex constraints
• Bounds on the geometric complexity of optimal centroidal Voronoi tesselations in 3D
• Higher-dimensional Voronoi diagrams in linear expected time

Describes a project that uses

Uses Software

• Mathematica

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1309732)