On geodesic disks enclosing many points
Prosenjit Bose, Guillermo Esteban, David Orden, Rodrigo Silveira, Tyler Tuttle

TL;DR
This paper investigates bounds on the number of points enclosed by geodesic disks determined by pairs of points in various configurations, providing tight bounds for special cases and variants.
Contribution
It establishes new bounds for the maximum number of points enclosed by geodesic disks with pairs of points on their boundary, including special and two-colored variants.
Findings
Bounds for general point sets: eil;n/5 and eil;n/4+1.
Tight bounds for points on geodesically convex polygons: eil;n/3+1.
Bounds for two-colored variants: eil;n/5+1 and eil;n/11.1.
Abstract
Let be the largest number such that for every set of points in a polygon~, there always exist two points , where every geodesic disk containing and contains points of~. We establish upper and lower bounds for , and show that . We also show that there always exist two points such that every geodesic disk with and on its boundary contains at least points both inside and outside the disk. For the special case where the points of are restricted to be the vertices of a geodesically convex polygon we give a tight bound of . We provide the same tight bound when we only consider…
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.
