4.2 Article

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

相关参考文献

注意:仅列出部分参考文献,下载原文获取全部文献信息。
Article Computer Science, Software Engineering

Holes and islands in random point sets

Martin Balko et al.

Summary: This text discusses the concepts of k-islands and k-holes in a set of points in general position (S), as well as the expected number of k-holes in S when points are randomly chosen from a convex body K with volume 1. It shows that the expected number of k-holes in S is in O(nd) and provides an improved and generalized estimate compared to previous bounds. Additionally, it estimates the expected number of empty simplices in S and gives an asymptotically tight upper bound O(nd) even in a more general setting.

RANDOM STRUCTURES & ALGORITHMS (2022)

Article Mathematics

A superlinear lower bound on the number of 5-holes

Oswin Aichholzer et al.

JOURNAL OF COMBINATORIAL THEORY SERIES A (2020)

Article Computer Science, Theory & Methods

Empty convex hexagons in planar point sets

Tobias Gerken

DISCRETE & COMPUTATIONAL GEOMETRY (2008)

Article Computer Science, Theory & Methods

The empty hexagon theorem

Carlos M. Nicolas

DISCRETE & COMPUTATIONAL GEOMETRY (2007)

Article Mathematics

Volumes of symmetric random polytopes

MW Meckes

ARCHIV DER MATHEMATIK (2004)