Kinetic Geodesic Voronoi Diagrams in a Simple Polygon

by   Matias Korman, et al.

We study the geodesic Voronoi diagram of a set S of n linearly moving sites inside a static simple polygon P with m vertices. We identify all events where the structure of the Voronoi diagram changes, bound the number of such events, and then develop a kinetic data structure (KDS) that maintains the geodesic Voronoi diagram as the sites move. To this end, we first analyze how often a single bisector, defined by two sites, or a single Voronoi center, defined by three sites, can change. For both these structures we prove that the number of such changes is at most O(m^3), and that this is tight in the worst case. Moreover, we develop compact, responsive, local, and efficient kinetic data structures for both structures. Our data structures use linear space and process a worst-case optimal number of events. Our bisector KDS handles each event in O(log m) time, and our Voronoi center handles each event in O(log^2 m) time. Both structures can be extended to efficiently support updating the movement of the sites as well. Using these data structures as building blocks we obtain a compact KDS for maintaining the full geodesic Voronoi diagram.



There are no comments yet.


page 6

page 17

page 21


Dynamic Data Structures for k-Nearest Neighbor Queries

Our aim is to develop dynamic data structures that support k-nearest nei...

Farthest-point Voronoi diagrams in the presence of rectangular obstacles

We present an algorithm to compute the geodesic L_1 farthest-point Voron...

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...

Voronoi diagram of orthogonal polyhedra in two and three dimensions

Voronoi diagrams are a fundamental geometric data structure for obtainin...

Utility and Feasibility of a Center Surround Event Camera

Standard dynamic vision sensor (DVS) event cameras output a stream of sp...

Voronoi Diagrams in the Hilbert Metric

The Hilbert metric is a distance function defined for points lying withi...

Worst-Case Polylog Incremental SPQR-trees: Embeddings, Planarity, and Triconnectivity

We show that every labelled planar graph G can be assigned a canonical e...
This week in AI

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