Piercing pairwise intersecting geodesic disks

Prosenjit Bose, Paz Carmi, Thomas C. Shermer

Research output: Contribution to journalArticlepeer-review

1 Scopus citations


Given a simple polygon P on n vertices, nr of which are reflex, and a set D of m pairwise intersecting geodesic disks in P, we show that at most 14 points in P suffice to pierce all the disks in D and these points can be computed in O(n+mlog⁡nr) time.

Original languageEnglish
Article number101774
JournalComputational Geometry: Theory and Applications
StatePublished - 1 Oct 2021


  • Geodesic disk
  • Helly theorem
  • LP-type
  • Piercing set
  • Polygon

ASJC Scopus subject areas

  • Computer Science Applications
  • Geometry and Topology
  • Control and Optimization
  • Computational Theory and Mathematics
  • Computational Mathematics


Dive into the research topics of 'Piercing pairwise intersecting geodesic disks'. Together they form a unique fingerprint.

Cite this