45 search results - page 3 / 9 » A Topology Oriented Algorithm for the Voronoi Diagram of Pol... |
CCCG
2006
13 years 8 months ago
2006
In this paper, we propose an algorithm for computing the farthest-segment Voronoi diagram for the edges of a convex polygon and apply this to obtain an O(n log n) algorithm for th...
CAD
2006
Springer
13 years 7 months ago
2006
Springer
Presented in this paper is a sweepline algorithm to compute the Voronoi diagram of a set of circles in a two-dimensional Euclidean space. The radii of the circles are non-negative...
ICDAR
2009
IEEE
14 years 1 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...
COMPGEOM
2005
ACM
13 years 9 months ago
2005
ACM
We introduce a new type of diagram called the VV(c)-diagram (the visibility–Voronoi diagram for clearance c), which is a hybrid between the visibility graph and the Voronoi diag...
AAIM
2009
Springer
14 years 1 months ago
2009
Springer
We develop algorithms to compute Voronoi diagrams, shortest path maps, and the Fr´echet distance in the plane with polygonal obstacles. Distances between points are measured eithe...