215 search results - page 16 / 43 » Farthest-Polygon Voronoi Diagrams |
IJCGA
2008
13 years 7 months ago
2008
The Hausdorff distance between two sets of curves is a measure for the similarity of these objects and therefore an interesting feature in shape recognition. If the curves are alg...
ICDAR
2011
IEEE
12 years 7 months ago
2011
IEEE
— In Handwritten Character Recognition, zoning is rigtly considered as one of the most effective feature extraction techniques. In the past, many zoning methods have been propose...
CDC
2009
IEEE
14 years 9 days ago
2009
IEEE
— We present novel exploration algorithms and a control law that enable the construction of Voronoi diagrams over unknown areas using a single autonomous vehicle equipped with ra...
CCCG
2006
13 years 9 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...
SODA
2004
ACM
13 years 9 months ago
2004
ACM
Delaunay tessellations and Voronoi diagrams capture proximity relationships among sets of points in any dimension. When point coordinates are not known exactly, as in the case of ...