Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon

01/08/2018
by   Eunjin Oh, et al.
0

Given a set of sites in a simple polygon, a geodesic Voronoi diagram of the sites partitions the polygon into regions based on distances to sites under the geodesic metric. We present algorithms for computing the geodesic nearest-point, higher-order and farthest-point Voronoi diagrams of m point sites in a simple n-gon, which improve the best known ones for m <= n/ polylog n. Moreover, the algorithms for the geodesic nearest-point and farthest-point Voronoi diagrams are optimal for m <= n/ polylog n. This partially answers a question posed by Mitchell in the Handbook of Computational Geometry.

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
02/26/2021

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 c...
research
07/15/2013

On Soft Power Diagrams

Many applications in data analysis begin with a set of points in a Eucli...
research
08/02/2017

Improved Time-Space Trade-offs for Computing Voronoi Diagrams

Let P be a planar set of n sites in general position. For k∈{1,...,n-1},...
research
12/05/2021

Computing Voronoi Diagrams in the Polar-Coordinate Model of the Hyperbolic Plane

A Voronoi diagram is a basic geometric structure that partitions the spa...
research
04/25/2018

Stable-Matching Voronoi Diagrams: Combinatorial Complexity and Algorithms

We study algorithms and combinatorial complexity bounds for stable-match...
research
01/14/2022

A simple and fast algorithm for computing discrete Voronoi, Johnson-Mehl or Laguerre diagrams of points

This article presents an algorithm to compute digital images of Voronoi,...

Please sign up or login with your details

Forgot password? Click here to reset