### Abstract

Let P be a closed simple polygon with n vertices. For any two points in P, the geodesic distance between them is the length of the shortest path that connects them among all paths contained in P. The geodesic center of P is the unique point in P that minimizes the largest geodesic distance to all other points of P. In 1989, Pollack et al. (Discrete Comput Geom 4(1): 611–626, 1989) showed an O(nlog n) -time algorithm that computes the geodesic center of P. Since then, a longstanding question has been whether this running time can be improved. In this paper we affirmatively answer this question and present a deterministic linear-time algorithm to solve this problem.

Original language | English |
---|---|

Pages (from-to) | 836-859 |

Number of pages | 24 |

Journal | Discrete and Computational Geometry |

Volume | 56 |

Issue number | 4 |

DOIs | |

Publication status | Published - 2016 Dec 1 |

### Keywords

- Facility location
- Geodesic distance
- Simple polygons

### ASJC Scopus subject areas

- Theoretical Computer Science
- Geometry and Topology
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics

## Fingerprint Dive into the research topics of 'A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon'. Together they form a unique fingerprint.

## Cite this

*Discrete and Computational Geometry*,

*56*(4), 836-859. https://doi.org/10.1007/s00454-016-9796-0