Multiple polyline to polygon matching

M. Tanase, R.C. Veltkamp, H.J. Haverkort

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

12 Citaten (Scopus)


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 logmn). 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.
Originele taal-2Engels
TitelAlgorithms and computation : 16th international symposium, ISAAC2005, Sanya, Hainan, China, December 19-21, 2005 : proceedings
RedacteurenX. Deng, D. Du
Plaats van productieBerlin
ISBN van geprinte versie3-540-30935-7
StatusGepubliceerd - 2005

Publicatie series

NaamLecture Notes in Computer Science
ISSN van geprinte versie0302-9743


Duik in de onderzoeksthema's van 'Multiple polyline to polygon matching'. Samen vormen ze een unieke vingerafdruk.

Citeer dit