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

03/09/2018
by   Chih-Hung Liu, et al.
0

The geodesic Voronoi diagram of m point sites inside a simple polygon of n vertices is a subdivision of the polygon into m cells, one to each site, such that all points in a cell share the same nearest site under the geodesic distance. The best known lower bound for the construction time is Omega( n + m log m ), and a matching upper bound is a long-standing open question. The state-of-the-art construction algorithms achieve O( (n+m) log (n+m) ) and O( n+m log m log^2 n ) time, which are optimal for m=Omega(n) and m=O( n / log^3 n ), respectively. In this paper, we give a construction algorithm with O( n+m( log m+ log^2 n) ) time, and it is nearly optimal in the sense that if a single Voronoi vertex can be computed in O( log n ) time, then the construction time will become the optimal O( n+m log m ). In other words, we reduce the problem of constructing the diagram in the optimal time to the problem of computing a single Voronoi vertex in O( log n ) time.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/17/2018

The Geodesic Farthest-point Voronoi Diagram in a Simple Polygon

Given a set of point sites in a simple polygon, the geodesic farthest-po...
research
03/07/2022

Farthest-point Voronoi diagrams in the presence of rectangular obstacles

We present an algorithm to compute the geodesic L_1 farthest-point Voron...
research
12/23/2021

Approximating Multiplicatively Weighted Voronoi Diagrams: Efficient Construction with Linear Size

Given a set of n sites from ℝ^d, each having some positive weight factor...
research
11/17/2021

The Polygon Burning Problem

Motivated by the k-center problem in location analysis, we consider the ...
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
07/27/2020

Optimal construction of a layer-ordered heap

The layer-ordered heap (LOH) is a simple, recently proposed data structu...
research
07/13/2020

Predicates of the 3D Apollonius Diagram

In this thesis we study one of the fundamental predicates required for t...

Please sign up or login with your details

Forgot password? Click here to reset