Sciweavers

215 search results - page 7 / 43
» Farthest-Polygon Voronoi Diagrams
Sort
View
CCCG
2010
13 years 9 months ago
Existence of zone diagrams in compact subsets of uniformly convex spaces
A zone diagram is a relatively new concept which has emerged in computational geometry and is related to Voronoi diagrams. Formally, it is a fixed point of a certain mapping, and ...
Eva Kopecká, Daniel Reem, Simeon Reich
IPL
2006
108views more  IPL 2006»
13 years 7 months ago
Robustness of k-gon Voronoi diagram construction
In this paper, we present a plane sweep algorithm for constructing the Voronoi diagram of a set of non-crossing line segments in 2D space using a distance metric induced by a regu...
Zhenming Chen, Evanthia Papadopoulou, Jinhui Xu
HIS
2009
13 years 5 months ago
An Efficient VQ-Based Data Hiding Scheme Using Voronoi Clustering
In this paper, we propose a vector quantization (VQ) -based information hiding scheme that cluster the VQ codeowrds according the codewords' relation on Voronoi Diagram (VD). ...
Ming-Ni Wu, Puu-An Juang, Yu-Chiang Li
SMA
2008
ACM
182views Solid Modeling» more  SMA 2008»
13 years 7 months ago
Voronoi diagram computations for planar NURBS curves
We present robust and efficient algorithms for computing Voronoi diagrams of planar freeform curves. Boundaries of the Voronoi diagram consist of portions of the bisector curves b...
Joon-Kyung Seong, Elaine Cohen, Gershon Elber
GMP
2010
IEEE
214views Solid Modeling» more  GMP 2010»
13 years 12 months ago
Efficient Computation of 3D Clipped Voronoi Diagram
The Voronoi diagram is a fundamental geometry structure widely used in various fields, especially in computer graphics and geometry computing. For a set of points in a compact 3D d...
Dong-Ming Yan, Wenping Wang, Bruno Lévy, Ya...