The edge labeling of higher order Voronoi diagrams
Combinatorics
2021-12-21 v1 Computational Geometry
Discrete Mathematics
Abstract
We present an edge labeling of order- Voronoi diagrams, , of point sets in the plane, and study properties of the regions defined by them. Among them, we show that has a small orientable cycle and path double cover, and we identify configurations that cannot appear in for small values of . This paper also contains a systematic study of well-known and new properties of , all whose proofs only rely on elementary geometric arguments in the plane. The maybe most comprehensive study of structural properties of 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.
Cite
@article{arxiv.2109.13002,
title = {The edge labeling of higher order Voronoi diagrams},
author = {Mercè Claverol and Andrea de las Heras Parrilla and Clemens Huemer and Alejandra Martínez-Moraian},
journal= {arXiv preprint arXiv:2109.13002},
year = {2021}
}