The Voronoi-Quadtree: construction and visualization
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 p...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2002 |
| País: | España |
| Institución: | Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya) |
| Repositorio: | Recercat. Dipósit de la Recerca de Catalunya |
| OAI Identifier: | oai:recercat.cat:10256/24783 |
| Acceso en línea: | http://hdl.handle.net/10256/24783 |
| Access Level: | acceso abierto |
| Palabra clave: | Infografia Computer graphics Voronoi, Polígons de Voronoi, Polygons Algorismes computacionals Computer algorithms |
| Sumario: | 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 described |
|---|