2000 character limit reached
Piercing Pairwise Intersecting Geodesic Disks by Five Points (2112.05962v1)
Published 11 Dec 2021 in cs.CG
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.