# An Optimal Deterministic Algorithm for Geodesic Farthest-Point Voronoi Diagrams in Simple Polygons

Given a set S of m point sites in a simple polygon P of n vertices, we consider the problem of computing the geodesic farthest-point Voronoi diagram for S in P. It is known that the problem has an Ω(n+mlog m) time lower bound. Previously, a randomized algorithm was proposed [Barba, SoCG 2019] that can solve the problem in O(n+mlog m) expected time. The previous best deterministic algorithms solve the problem in O(nloglog n+ mlog m) time [Oh, Barba, and Ahn, SoCG 2016] or in O(n+mlog m+mlog^2 n) time [Oh and Ahn, SoCG 2017]. In this paper, we present a deterministic algorithm of O(n+mlog m) time, which is optimal. This answers an open question posed by Mitchell in the Handbook of Computational Geometry two decades ago.

Comments

There are no comments yet.

## Authors

• 19 publications
• ### Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon

Given a set of sites in a simple polygon, a geodesic Voronoi diagram of ...
01/08/2018 ∙ by Eunjin Oh, et al. ∙ 0

read it

• ### On the Planar Two-Center Problem and Circular Hulls

Given a set S of n points in the Euclidean plane, the two-center problem...
02/19/2020 ∙ by Haitao Wang, et al. ∙ 0

read it

• ### Geodesic farthest-point Voronoi diagram in linear time

Let P be a simple polygon with n vertices. For any two points in P, the ...
09/05/2018 ∙ by Luis Barba, et al. ∙ 0

read it

• ### Quantum algorithms for computational geometry problems

We study quantum algorithms for problems in computational geometry, such...
04/19/2020 ∙ by Andris Ambainis, et al. ∙ 0

read it

• ### A Nearly Optimal Algorithm for the Geodesic Voronoi Diagram in a Simple Polygon

The geodesic Voronoi diagram of m point sites inside a simple polygon of...
03/09/2018 ∙ by Chih-Hung Liu, et al. ∙ 0

read it

• ### A Deterministic Linear Program Solver in Current Matrix Multiplication Time

Interior point algorithms for solving linear programs have been studied ...
10/25/2019 ∙ by Jan van den Brand, et al. ∙ 0

read it

• ### Listing Conflicting Triples in Optimal Time

Different sources of information might tell different stories about the ...
11/25/2019 ∙ by Mathias Weller, et al. ∙ 0

read it

##### This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.