On equidistant polytopes in the Euclidean space
Csaba Vincze, M\'ark Ol\'ah, Let\'icia Lengyel

TL;DR
This paper studies equidistant polytopes in Euclidean space, exploring their properties, classifications, and special cases like equidistant polygons, with a focus on types involving inner and outer focal points and their geometric characterizations.
Contribution
It introduces a comprehensive framework for understanding equidistant polytopes, including their properties, graph representations, and specific characterizations of equidistant polygons of type (3,2).
Findings
Equidistant polytopes generalize convexity.
Characterization of equidistant polygons of type (3,2).
Constructive recognition process for certain equidistant polygons.
Abstract
An equidistant polytope is a special equidistant set in the space all of whose boundary points have equal distances from two finite systems of points. Since one of the finite systems of the given points is required to be in the interior of the convex hull of the other one we can speak about inner and outer focal points of the equidistant polytope. It is of type , where is the number of the outer focal points and is the number of the inner focal points. The equidistancy is the generalization of convexity because a convex polytope can be given as an equidistant polytope of type , where . In the paper we present some general results about the basic properties of the equidistant polytopes: convex components, graph representations, connectedness, correspondence to the Voronoi decomposition of the space etc. Especially, we are interested in…
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.
