Piercing Pairwise Intersecting Geodesic Disks by Five Points

2021/12/11 by A. Karim Abu-Affash, Abu-Affash, A. Karim, Paz Carmi +3
Arts and Humanities · Engineering · #Advanced Numerical Analysis Techniques #Computational Geometry (cs.CG) #FOS: Computer and information sciences #Historical and Archaeological Studies #Medieval Literature and History

paper · pdf · doi:10.48550/arxiv.2112.05962

openalex publication_date 2021/12/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related

• On geodesic disks enclosing many points
• Stabbing Pairwise Intersecting Disks by Four Points
• Packing and Covering a Polygon with Geodesic Disks
• The intersection graph of the disks with diameters the sides of a convex n-gon
• Closed simple geodesics on a polyhedron