2000 character limit reached
Piercing Pairwise Intersecting Geodesic Disks by Five Points
Published 11 Dec 2021 in cs.CG | (2112.05962v1)
Abstract: Given a simple polygon $P$ on $n$ vertices, and a set $D$ of $m$ pairwise intersecting geodesic disks in $P$, we show that five points in $P$ are always sufficient to pierce all the disks in $D$. This improves the previous bound of 14, obtained by Bose, Carmi, and Shermer.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.