Springe direkt zu Inhalt

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.

Titel
Polygonal Chains with pairwise identical Hausdorff Distance
Verfasser
Lutz Meißner
Verlag
Freie Universität Berlin, Institut für Informatik
Ort
Takustraße 9, 14195 Berlin
Schlagwörter
Polygonal chains, Hausdorff distance, Voronoi Diagram, pairwise distances
Datum
2009-07
Kennung
TR-B-09-10
Quelle/n
Sprache
eng
Art
Text
Rechte
Freie Universität Berlin, Institut für Informatik