The Voronoi Diagram of Rotating Rays with applications to Floodlight Illumination

by   Carlos Alegría, et al.

We study the Voronoi Diagram of Rotating Rays, a Voronoi structure where the input sites are rays and the distance function between a point and a site/ray, is the counterclockwise angular distance. This novel Voronoi diagram is motivated by illumination or coverage problems, where a domain must be covered by floodlights/wedges of uniform angle, and the goal is to find the minimum angle necessary to cover the domain. We study the diagram in the plane, and we present structural properties, combinatorial complexity bounds, and a construction algorithm. If the rays are induced by a convex polygon, we show how to construct the Voronoi diagram within this polygon in linear time. Using this information, we can find in optimal linear time the Brocard angle, the minimum angle required to illuminate a convex polygon with floodlights of uniform angle.


page 5

page 10

page 12

page 18

page 21

page 22

page 23


Voronoi Diagrams in the Hilbert Metric

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

Deletion in abstract Voronoi diagrams in expected linear time

Updating an abstract Voronoi diagram in linear time, after deletion of o...

Geodesic farthest-point Voronoi diagram in linear time

Let P be a simple polygon with n vertices. For any two points in P, the ...

Predicates of the 3D Apollonius Diagram

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

The geodesic edge center of a simple polygon

The geodesic edge center of a polygon is a point c inside the polygon th...

Approximating Multiplicatively Weighted Voronoi Diagrams: Efficient Construction with Linear Size

Given a set of n sites from ℝ^d, each having some positive weight factor...

Computing the Inversion-Indel Distance

The inversion distance, that is the distance between two unichromosomal ...

Please sign up or login with your details

Forgot password? Click here to reset