The geodesic diameter of polygonal domains

Sang Won Bae, Matias Korman, Yoshio Okamoto

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)


This paper studies the geodesic diameter of polygonal domains having h holes and n corners. For simple polygons (i.e., h = 0), it is known that the geodesic diameter is determined by a pair of corners of a given polygon and can be computed in linear time. For general polygonal domains with h ≥ 1, however, no algorithm for computing the geodesic diameter was known prior to this paper. In this paper, we present the first algorithm that computes the geodesic diameter of a given polygonal domain in worst-case time O(n 7.73) or O(n 7 (logn + h)). Among other results, we show the following geometric observation: the geodesic diameter can be determined by two points in its interior. In such a case, there are at least five shortest paths between the points.

Original languageEnglish
Title of host publicationAlgorithms, ESA 2010 - 18th Annual European Symposium, Proceedings
Number of pages12
EditionPART 1
Publication statusPublished - 2010
Externally publishedYes
Event18th Annual European Symposium on Algorithms, ESA 2010 - Liverpool, United Kingdom
Duration: 2010 Sep 62010 Sep 8

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 1
Volume6346 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other18th Annual European Symposium on Algorithms, ESA 2010
Country/TerritoryUnited Kingdom

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'The geodesic diameter of polygonal domains'. Together they form a unique fingerprint.

Cite this