Anzeige
Erschienen in:
2005 | OriginalPaper | Buchkapitel
Multiple Polyline to Polygon Matching
verfasst von : Mirela Tănase, Remco C. Veltkamp, Herman Haverkort
Erschienen in: Algorithms and Computation
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We introduce a measure for computing the similarity between multiple polylines and a polygon, that can be computed in
O
(
km
2
n
2
) time with a straightforward dynamic programming algorithm. We then present a novel fast algorithm that runs in time
O
(
kmn
log
mn
). Here,
m
denotes the number of vertices in the polygon, and
n
is the total number of vertices in the
k
polylines that are matched against the polygon. The effectiveness of the similarity measure has been demonstrated in a part-based retrieval application with known ground-truth.