@inproceedings{2d3a5b1ea4cb4b0abf9a08e123366c34,
title = "Multiple polyline to polygon matching",
abstract = "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.",
author = "M. Tanase and R.C. Veltkamp and H.J. Haverkort",
year = "2005",
doi = "10.1007/11602613_8",
language = "English",
isbn = "3-540-30935-7",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "60--70",
editor = "X. Deng and D. Du",
booktitle = "Algorithms and computation : 16th international symposium, ISAAC2005, Sanya, Hainan, China, December 19-21, 2005 : proceedings",
address = "Germany",
}