Fitting Voronoi Diagrams to Planar Tesselations
Computational Geometry
2013-08-27 v1
Abstract
Given a tesselation of the plane, defined by a planar straight-line graph , we want to find a minimal set of points in the plane, such that the Voronoi diagram associated with "fits" \ . This is the Generalized Inverse Voronoi Problem (GIVP), defined in \cite{Trin07} and rediscovered recently in \cite{Baner12}. Here we give an algorithm that solves this problem with a number of points that is linear in the size of , assuming that the smallest angle in is constant.
Cite
@article{arxiv.1308.5550,
title = {Fitting Voronoi Diagrams to Planar Tesselations},
author = {Greg Aloupis and Hebert Pérez-Rosés and Guillermo Pineda-Villavicencio and Perouz Taslakian and Dannier Trinchet},
journal= {arXiv preprint arXiv:1308.5550},
year = {2013}
}
Comments
14 pages, 8 figures, 1 table. Presented at IWOCA 2013 (Int. Workshop on Combinatorial Algorithms), Rouen, France, July 2013