Computing the geodesic centers of a polygonal domain

Sang Won Bae, Matias Korman, Yoshio Okamoto

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)


We present an algorithm that computes the geodesic center of a given polygonal domain. The running time of our algorithm is O(n12+ϵ) for any ϵ>0, where n is the number of corners of the input polygonal domain. Prior to our work, only the very special case where a simple polygon is given as input has been intensively studied in the 1980s, and an O(nlog⁡n)-time algorithm is known by Pollack et al. Our algorithm is the first one that can handle general polygonal domains having one or more polygonal holes.

Original languageEnglish
Pages (from-to)3-9
Number of pages7
JournalComputational Geometry: Theory and Applications
Publication statusPublished - 2019 Mar


  • Exact algorithm
  • Geodesic center
  • Polygonal domain
  • Shortest path

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 'Computing the geodesic centers of a polygonal domain'. Together they form a unique fingerprint.

Cite this