Concurrent normals problem for convex polytopes and Euclidean distance degree
Ivan Nasonov, Gaiane Panina, Dirk Siersma

TL;DR
This paper investigates the concurrent normals problem for convex polytopes in three-dimensional space, providing new bounds, conjectures, and conditions for the number of normals from interior points, with specific results for certain polytope classes.
Contribution
It establishes that convex polytopes in D have at least 8 concurrent normals from an interior point, proposes a conjecture for 10 normals, and confirms it for certain polytope types.
Findings
Convex polytopes in D have at least 8 concurrent normals from an interior point.
Conjecture that simple polytopes in D have a point with 10 normals.
Confirmed the 10-normal conjecture for tetrahedra and triangular prisms.
Abstract
It is conjectured since long that for any convex body there exists a point in its interior which belongs to at least normals from different points on the boundary of . The conjecture is known to be true for . We treat the same problem for convex polytopes in . It turns out that the PL concurrent normals problem differs a lot from the smooth one. One almost immediately proves that a convex polytope in has normals to its boundary emanating from some point in its interior. Moreover, we conjecture that each simple polytope in has a point in its interior with normals to the boundary. We confirm the conjecture for all tetrahedra and triangular prisms and give a sufficient condition for a simple polytope to have a point with normals. Other related topics (average number of normals, minimal…
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
TopicsGraph theory and applications · Point processes and geometric inequalities · Mathematical Inequalities and Applications
