215 search results - page 20 / 43 » Farthest-Polygon Voronoi Diagrams |
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...
ICPP
2006
IEEE
14 years 1 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 25 days 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...
IROS
2006
IEEE
14 years 1 months ago
2006
IEEE
— This paper presents a new sensor based global Path Planner which operates in two steps. In the first step the safest areas in the environment are extracted by means of a Voron...
ICDAR
2009
IEEE
14 years 2 months ago
2009
IEEE
This paper presents a dynamic approach to document page segmentation. Current page segmentation algorithms lack the ability to dynamically adapt local variations in the size, orie...