The Voronoi-Quadtree: construction and visualization

Simple item page
dc.contributor.authorColl, NarcĂ­sen_US
dc.contributor.authorBoada, Immaen_US
dc.contributor.authorSellares, J.A.en_US
dc.date.accessioned2015-11-12T07:16:53Z
dc.date.available2015-11-12T07:16:53Z
dc.date.issued2002en_US
dc.description.abstractWe 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.en_US
dc.description.seriesinformationEurographics 2002 - Short Presentationsen_US
dc.identifier.issn1017-4656en_US
dc.identifier.urihttps://doi.org/10.2312/egs.20021044en_US
dc.publisherEurographics Associationen_US
dc.titleThe Voronoi-Quadtree: construction and visualizationen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
short90.pdf
Size:
171.02 KB
Format:
Adobe Portable Document Format
Download
Collections
Short Presentations