Tight bounds on the expected number of holes in random point sets

DOI10.1002/rsa.21088zbMath1523.60031arXiv2111.12533OpenAlexW4225258250MaRDI QIDQ6077049

Martin Balko, Pavel Valtr, Manfred Scheucher

Publication date: 17 October 2023

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2111.12533

zbMATH Keywords

stochastic geometryconvex positionrandom point set\(k\)-hole

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Random convex sets and integral geometry (aspects of convex geometry) (52A22)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On empty triangles determined by points in the plane
• Sets in \(\mathbb{R}^ d\) with no large empty convex subsets
• Volumes of symmetric random polytopes
• A superlinear lower bound on the number of 5-holes
• The empty hexagon theorem
• Empty convex hexagons in planar point sets
• On some mean values associated with a randomly selected simplex in a convex set
• Stochastic and Integral Geometry
• Sets with No Empty Convex 7-Gons
• Empty Simplices in Euclidean Space
• Random approximation of convex sets*
• Empty non-convex and convex four-gons in random point sets
• Convex Bodies The Brunn-MinkowskiTheory
• Planar point sets with a small number of empty convex polygons
• A Compactness Theorem For Affine Equivalence-Classes of Convex Regions
• Holes and islands in random point sets

This page was built for publication: Tight bounds on the expected number of holes in random point sets