The edge labeling of higher order Voronoi diagrams

09/27/2021
by   Mercè Claverol, et al.
0

We present an edge labeling of order-k Voronoi diagrams, V_k(S), of point sets S in the plane, and study properties of the regions defined by them. Among them, we show that V_k(S) has a small orientable cycle and path double cover, and we identify configurations that cannot appear in V_k(S) for small values of k. This paper also contains a systematic study of well-known and new properties of V_k(S), all whose proofs only rely on elementary geometric arguments in the plane. The maybe most comprehensive study of structural properties of V_k(S) was done by D.T. Lee (On k-nearest neighbor Voronoi diagrams in the plane) in 1982. Our work reviews and extends the list of properties of higher order Voronoi diagrams.

READ FULL TEXT

page 4

page 19

page 25

page 39

research
07/12/2019

On circles enclosing many points

We prove that every set of n red and n blue points in the plane contains...
research
07/27/2022

Voronoi Diagrams of Arbitrary Order on the Sphere

For a given set of points U on a sphere S, the order k spherical Voronoi...
research
11/19/2020

Adversarial Examples for k-Nearest Neighbor Classifiers Based on Higher-Order Voronoi Diagrams

Adversarial examples are a widely studied phenomenon in machine learning...
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
08/31/2017

Lombardi Drawings of Knots and Links

Knot and link diagrams are projections of one or more 3-dimensional simp...
research
02/04/2021

Force-Directed Layout of Order Diagrams using Dimensional Reduction

Order diagrams allow human analysts to understand and analyze structural...
research
09/25/2019

Asymptotics of Wide Networks from Feynman Diagrams

Understanding the asymptotic behavior of wide networks is of considerabl...

Please sign up or login with your details

Forgot password? Click here to reset