221 search results - page 10 / 45 » Rounding Voronoi diagram |
ISVD
2007
IEEE
14 years 4 months ago
2007
IEEE
We consider finite sets of oriented spheres in Rk−1 and, by interpreting such spheres as points in Rk , study the Voronoi diagrams they induce for several variants of distance ...
ISVD
2007
IEEE
14 years 4 months ago
2007
IEEE
Jump flooding algorithm (JFA) is an interesting way to utilize the graphics processing unit to efficiently compute Voronoi diagrams and distance transforms in 2D discrete space. T...
ICPP
2006
IEEE
14 years 3 months ago
2006
IEEE
We present the first parallel algorithm for building a Hausdorff Voronoi diagram (HVD). Our algorithm is targeted towards cluster computing architectures and computes the Hausdor...
BIRTHDAY
2003
Springer
14 years 3 months ago
2003
Springer
We discuss the design of Java applets that visualize how the Voronoi diagram of n points continuously changes as individual points are moved across the plane, or as the underlying...
ESA
2008
Springer
13 years 11 months ago
2008
Springer
We prove tight bounds on the complexity of bisectors and Voronoi diagrams on so-called realistic terrains, under the geodesic distance. In particular, if n denotes the number of tr...