No Selection Lemma for Empty Triangles
Ruy Fabila-Monroy, Carlos Hidalgo-Toscano, Daniel Perz, Birgit, Vogtenhuber

TL;DR
This paper investigates empty triangles in point sets, disproving a conjecture by showing that the maximum number of empty triangles incident to any point aligns with known upper bounds, even in the case of empty triangles.
Contribution
The paper proves that the upper bound on the number of empty triangles incident to any point applies to empty triangles, countering Bárány's conjecture.
Findings
Existence of point sets with many empty triangles where no point is in more than O(n^{3-2α}) empty triangles.
Disproof of Bárány's conjecture regarding the incidence of empty triangles.
Confirmation that the upper bound for empty triangles matches the general case.
Abstract
Let be a set of points in general position in the plane. The Second Selection Lemma states that for any family of triangles spanned by , there exists a point of the plane that lies in a constant fraction of them. For families of triangles, with , there might not be a point in more than of those triangles. An empty triangle of is a triangle spanned by not containing any point of in its interior. B\'ar\'any conjectured that there exist an edge spanned by that is incident to a super constant number of empty triangles of . The number of empty triangles of might be ; in such a case, on average, every edge spanned by is incident to a constant number of empty triangles. The conjecture of B\'ar\'any suggests that for the class of empty triangles the above upper bound…
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 · Advanced Topology and Set Theory · Optimization and Variational Analysis
