Stars of empty simplices

From MaRDI portal




Abstract: Let X=x1,ldots,xnsubsetmathbbRd be an n-element point set in general position. For a k-element subset xi1,ldots,xiksubsetX let the degree mdegk(xi1,ldots,xik) be the number of empty simplices xi1,ldots,xid+1subsetX containing no other point of X. The k-degree of the set X, denoted mdegk(X), is defined as the maximum degree over all k-element subset of X. We show that if X is a random point set consisting of n independently and uniformly chosen points from a compact set K then mdegd(X)=Theta(n), improving results previously obtained by B'ar'any, Marckert and Reitzner [Many empty triangles have a common edge, Discrete Comput. Geom., 2013] and Temesvari [Moments of the maximal number of empty simplices of a random point set, Discrete Comput. Geom., 2018] and giving the correct order of magnitude with a significantly simpler proof. Furthermore, we investigate mdegk(X). In the case k=1 we prove that mdeg1(X)=Theta(nd1).











This page was built for publication: Stars of empty simplices

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