Ball polytopes and the Vazsonyi problem
Yaakov S. Kupitz, Horst Martini, Micha A. Perles

TL;DR
This paper studies the geometric properties of ball polytopes formed by finite point sets in Euclidean space, characterizes extremal sets with maximal diameter segments, and relates these to the structure of the boundary complex.
Contribution
It introduces a detailed analysis of the boundary complex of ball polytopes and characterizes extremal point sets achieving maximal diameter segment counts.
Findings
The boundary complex of B(V) is self-dual for extremal sets.
V is extremal iff it coincides with the vertices of B(V).
The paper extends the Vazsonyi conjecture to characterize extremal configurations.
Abstract
Let V be a finite set of points in Euclidean d-space (d >= 2). The intersection of all unit balls B(v,1) centered at v, where v ranges over V, henceforth denoted by B(V) is the ball polytope associated with V. Note that B(V) is non-empty iff the circumradius of V is <= 1. After some preparatory discussion on spherical convexity and spindle convexity, the paper focuses on two central themes. [a] Define the boundary complex of B(V) (assuming it is non-empty, of course), i.e., define its vertices, edges and facets in dimension 3 (in dimension 2 this complex is just a circuit), and investigate its basic properties. [b] Apply results of this investigation to characterize finite sets of diameter 1 in (Euclidean) 3-space for which the diameter is attained a maximal number of times as a segment (of length 1) with both endpoints in V. A basic result for such a characterization goes back to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPoint processes and geometric inequalities · Computational Geometry and Mesh Generation · Advanced Graph Theory Research
