On Lines Crossing Pairwise Intersecting Convex Sets in Three Dimensions
Natan Rubin

TL;DR
This paper proves that in three-dimensional space, any large family of pairwise intersecting convex sets always admits a line crossing a linear number of them, advancing understanding of line transversals in geometric configurations.
Contribution
It establishes that such families always have a line crossing a linear number of sets, resolving a key open problem and providing new conditions for line transversals.
Findings
Existence of a line crossing Θ(n) convex sets in 3D
Resolution of a problem posed by Martínez et al. (2020)
Introduction of a Ramsey-type result for convex sets in 2D
Abstract
The 1913 Helly's theorem states that any family of convex sets in can be pierced by a single point if and only if any of 's elements can. In 2002 Alon, Kalai, Matou\v{s}ek and Meshulam ruled out the possibility of similar criteria for the existence of lines crossing multiple convex sets in dimension -- for any , they described arbitrary large families of convex sets in so that any elements of can be crossed by a line yet no of them can. Let be a family of pairwise intersecting convex sets in . We show that there exists a line crossing elements of . This resolves the most extensively studied variant of a problem by Mart\'inez, Rold\'an-Pensado and Rubin (Discrete Comput. Geom. 2020) which was highlighted by…
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
TopicsComputational Geometry and Mesh Generation · Complexity and Algorithms in Graphs · Point processes and geometric inequalities
