Cutting convex curves
Andreas F. Holmsen, J\'anos Kincses, Edgardo Rold\'an-Pensado

TL;DR
The paper proves that for any two convex curves with opposite orientations in Euclidean space, there exists a hyperplane separating their corresponding points at each parameter, based on a general equipartition result.
Contribution
It introduces a novel geometric separation theorem for convex curves with opposite orientations using hyperplanes and equipartitions.
Findings
Existence of a separating hyperplane for convex curves with opposite orientations.
Generalization to equipartitions of ordered point sets.
Application to convex geometry and hyperplane arrangements.
Abstract
We show that for any two convex curves and in parametrized by with opposite orientations, there exists a hyperplane with the following property: For any the points and are never in the same open halfspace bounded by . This will be deduced from a more general result on equipartitions of ordered point sets by hyperplanes.
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 · Geometric and Algebraic Topology
