2026-04-17T05:18:19Zhttps://recercat.cat/oai/requestoai:recercat.cat:10256/247832024-06-18T12:19:25Zcom_2072_452955com_2072_2054col_2072_453069
RECERCAT
author
Coll i Arnau, Narcís
author
Boada, Imma
author
Sellarès i Chiva, Joan Antoni
2024-06-18T12:19:24Z
2024-06-18T12:19:24Z
2002
http://hdl.handle.net/10256/24783
We define a quadtree-based planar Voronoi diagram codification, the Voronoi-Quadtree, valid for generalized sites (points, line-segments, curve-arc segments, ...) and for different distance functions (Euclidean metrics, convex distance functions, ...).We present an algorithm for constructing, at a prefixed level of detail, the Voronoi-Quadtree associated to a Voronoi diagram determined by a set of sites and a given distance function. A second algorithm that, taking as input a Voronoi-Quadtree, visualizes a polygonal approximation of the boundary of the Voronoi diagram is also describedThis work was supported by DURSI 2001SGR-00296. The first author was supported in part by grants TIC2000-1009 and TIC2001-2226-C02-02. The second and third authors were supported in part by grants MEC-DGES-SEUID PB98-0933, and TIC2001-2392-C03-01
Tots els drets reservats. Reproduït amb el permís d'Eurographics Publishing info:eu-repo/semantics/openAccess
Infografia
Computer graphics
Voronoi, Polígons de
Voronoi, Polygons
Algorismes computacionals
Computer algorithms
The Voronoi-Quadtree: construction and visualization
info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion