File(s) under permanent embargo
Fitting Voronoi diagrams to planar tesselations
conference contribution
posted on 2013-01-01, 00:00 authored by G Aloupis, H Pérez-Rosés, Guillermo Pineda VillavicencioGuillermo Pineda Villavicencio, P Taslakian, D Trinchet-AlmaguerGiven a tesselation of the plane, defined by a planar straight-line graph G, we want to find a minimal set S of points in the plane, such that the Voronoi diagram associated with S 'fits' G. This is the Generalized Inverse Voronoi Problem (GIVP), defined in [12] and rediscovered recently in [3]. Here we give an algorithm that solves this problem with a number of points that is linear in the size of G, assuming that the smallest angle in G is constant.
History
Event
Combinatorial Algorithms. Workshop (24th : 2013 : Rouen, France)Volume
8288Series
Combinatorial Algorithms WorkshopPagination
349 - 361Publisher
SpringerLocation
Rouen, FrancePlace of publication
Berlin, GermanyPublisher DOI
Start date
2013-07-10End date
2013-07-12ISSN
0302-9743eISSN
1611-3349ISBN-13
9783642452772Language
engPublication classification
E1.1 Full written paper - refereedCopyright notice
2013, Springer-Verlag Berlin HeidelbergEditor/Contributor(s)
T Lecroq, L MouchardTitle of proceedings
IWOCA 2013 : Proceedings of the 24th International Workshop on Combinatorial Algorithms 2013Usage metrics
Categories
No categories selectedLicence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC