On Crossing-Families in Planar Point Sets
Oswin Aichholzer, Jan Kyn\v{c}l, Manfred Scheucher, Birgit, Vogtenhuber, Pavel Valtr

TL;DR
This paper improves bounds on the size of crossing families in planar point sets, showing that small point sets guarantee a crossing family of size 4, and providing upper bounds for larger sets.
Contribution
The paper presents new bounds on crossing families in planar point sets, improving previous results with bounds based on small cardinality sets.
Findings
Any set of at least 15 points contains a crossing family of size 4.
There exist point sets with no crossing family larger than approximately 8 times the ceiling of n/41.
Both results improve upon earlier known bounds.
Abstract
A -crossing family in a point set in general position is a set of segments spanned by points of such that all segments mutually cross. In this short note we present two statements on crossing families which are based on sets of small cardinality: (1) Any set of at least 15 points contains a crossing family of size 4. (2) There are sets of points which do not contain a crossing family of size larger than . Both results improve the previously best known bounds.
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 · Remote Sensing and LiDAR Applications · Advanced Numerical Analysis Techniques
