Computing the geodesic centers of a polygonal domain

Sang Won Bae, Matias Korman, Yoshio Okamoto

Research output: Contribution to conferencePaperpeer-review

5 Citations (Scopus)

Abstract

We present an algorithm that exactly 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(n log n)-time algorithm is known by Pollack et al. Our algorithm is the first one that handles general polygonal domains that may have one or more polygonal holes.

Original languageEnglish
Pages20-25
Number of pages6
Publication statusPublished - 2014 Jan 1
Externally publishedYes
Event26th Canadian Conference on Computational Geometry, CCCG 2014 - Halifax, Canada
Duration: 2014 Aug 112014 Aug 13

Other

Other26th Canadian Conference on Computational Geometry, CCCG 2014
Country/TerritoryCanada
CityHalifax
Period14/8/1114/8/13

ASJC Scopus subject areas

  • Geometry and Topology
  • Computational Mathematics

Fingerprint

Dive into the research topics of 'Computing the geodesic centers of a polygonal domain'. Together they form a unique fingerprint.

Cite this