Sciweavers

254 search results - page 5 / 51
» Simplified Voronoi Diagrams
Sort
View
WADS
2001
Springer
105views Algorithms» more  WADS 2001»
13 years 12 months ago
Voronoi Diagrams for Moving Disks and Applications
In this paper we discuss the kinetic maintenance of the Euclidean Voronoi diagram and its dual, the Delaunay triangulation, for a set of moving disks. The most important aspect in ...
Menelaos I. Karavelas
COMPGEOM
1999
ACM
13 years 12 months ago
Crust and Anti-Crust: A One-Step Boundary and Skeleton Extraction Algorithm
We wish to extract the topology from scanned maps. In previous work [15] this was done by extracting a skeleton from the Voronoi diagram, but this required vertex labelling and wa...
Christopher M. Gold
ISVD
2007
IEEE
14 years 1 months ago
Computing the 3D Voronoi Diagram Robustly: An Easy Explanation
Many algorithms exist for computing the 3D Voronoi diagram, but in most cases they assume that the input is in general position. Because of the many degeneracies that arise in 3D ...
Hugo Ledoux
WSCG
2003
163views more  WSCG 2003»
13 years 9 months ago
Constructing Approximate Voronoi Diagrams from Digital Images of Generalized Polygons and Circular Objects
In this paper we present the geometrical construction of an approximate generalized Voronoi diagram for generalized polygons and circular objects based on their minimum geometrica...
W. L. Roque, D. Doering
ISVD
2010
IEEE
13 years 6 months ago
Fast Dynamic Voronoi Treemaps
—The Voronoi Treemap is a space-filling treemap technique that relaxes the constraints of rectangular nodes. Its organic shapes maintain a one-to-one aspect ratio, are flexible...
Avneesh Sud, Danyel Fisher, Huai-Ping Lee