# The geodesic edge center of a simple polygon

The geodesic edge center of a polygon is a point c inside the polygon that minimizes the maximum geodesic distance from c to any edge of the polygon, where geodesic distance is the shortest path distance inside the polygon. We give a linear-time algorithm to find a geodesic edge center of a simple polygon. This improves on the previous O(n log n) time algorithm by Lubiw and Naredla [European Symposium on Algorithms, 2021]. The algorithm builds on an algorithm to find the geodesic vertex center of a simple polygon due to Pollack, Sharir, and Rote [Discrete Computational Geometry, 1989] and an improvement to linear time by Ahn, Barba, Bose, De Carufel, Korman, and Oh [Discrete Computational Geometry, 2016]. The geodesic edge center can easily be found from the geodesic farthest-edge Voronoi diagram of the polygon. Finding that Voronoi diagram in linear time is an open question, although the geodesic nearest edge Voronoi diagram (the medial axis) can be found in linear time. As a first step of our geodesic edge center algorithm, we give a linear-time algorithm to find the geodesic farthest-edge Voronoi diagram restricted to the polygon boundary.

• 24 publications
• 6 publications
research
06/24/2020

### A Linear-Time Algorithm for Discrete Radius Optimally Augmenting Paths in a Metric Space

Let P be a path graph of n vertices embedded in a metric space. We consi...
research
08/16/2021

### The Visibility Center of a Simple Polygon

We introduce the visibility center of a set of points inside a polygon –...
research
03/30/2023

### A Subquadratic Time Algorithm for the Weighted k-Center Problem on Cactus Graphs

The weighted k-center problem in graphs is a classical facility location...
research
08/29/2019

### A Time-space Trade-off for Computing the Geodesic Center of a Simple Polygon

In this paper we study the problem of computing the geodesic center of a...
research
07/19/2020

### Shortest Secure Path in a Voronoi Diagram

We investigate the problem of computing the shortest secure path in a Vo...
research
04/22/2023

### The Voronoi Diagram of Rotating Rays with applications to Floodlight Illumination

We study the Voronoi Diagram of Rotating Rays, a Voronoi structure where...
research
02/21/2022

### Loop unrolling of UCA models: distance labeling

A proper circular-arc (PCA) model is a pair M = (C, A) where C is a circ...