On 2-Site Voronoi Diagrams under Geometric Distance Functions
Computational Geometry
2015-03-19 v1
Abstract
We revisit a new type of a Voronoi diagram, in which distance is measured from a point to a pair of points. We consider a few more such distance functions, based on geometric primitives, and analyze the structure and complexity of the nearest- and furthest-neighbor Voronoi diagrams of a point set with respect to these distance functions.
Cite
@article{arxiv.1105.4130,
title = {On 2-Site Voronoi Diagrams under Geometric Distance Functions},
author = {Gill Barequet and Matthew T. Dickerson and David Eppstein and David Hodorkovsky and Kira Vyatkina},
journal= {arXiv preprint arXiv:1105.4130},
year = {2015}
}
Comments
8 pages, 7 figures; to appear in Proc. the 8th ISVD, Qingdao, China, June 28-30, 2011, published by IEEE CS