Polygonal Chains with pairwise identical Hausdorff Distance

Lutz Meißner— 2009

The complexity of the Voronoi diagram for n polygonal chains and the Hausdorff distance is shown to be worst case 2n −1. Some bounds are given on the number of chains with limited size and fixed distance, and the relation between the sizes of two polygonal chains and their distance is examined.

TitelPolygonal Chains with pairwise identical Hausdorff Distance
VerfasserLutz Meißner
VerlagFreie Universität Berlin, Institut für Informatik
OrtTakustraße 9, 14195 Berlin
ThemaPolygonal chains, Hausdorff distance, Voronoi Diagram, pairwise distances
Datum200907
KennungTR-B-09-10
Quelle/n
Spracheeng
ArtText
RechteFreie Universität Berlin, Institut für Informatik