215 search results - page 9 / 43 » Bregman Voronoi Diagrams |
ESA
2007
Springer
14 years 1 months ago
2007
Springer
Given a family of k disjoint connected polygonal sites of total complexity n, we consider the farthest-site Voronoi diagram of these sites, where the distance to a site is the dis...
MFCS
1994
Springer
13 years 11 months ago
1994
Springer
We show that the wavefront approach to Voronoi diagrams (a deterministic line sweep algorithm that does not use geometric transform) can be generalized to distance measures more g...
JGTOOLS
2006
13 years 7 months ago
2006
We present a graphics hardware implementation of the tangent-plane algorithm for computing the kth-order Voronoi diagram of a set of point sites in image space. Correct and effici...
ISVD
2007
IEEE
14 years 1 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 1 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...