The problem of matching sets of points or sets of horizontal line segments in plane under translations is considered. For finding the exact occurrences of a point set of size m within another point set of size n we give an algorithm with running time O(mn), and for finding partial occurrences an algorithm with running time O(mnlogm). To find the largest overlap between two line segment patterns we develop an algorithm with running time O(mnlog(mn)). All algorithms are based on a simple sweepline traversal of one of the patterns in the lexicographic order. The motivation for the problems studied comes from music retrieval and analysis. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Ukkonen, E., Lemström, K., & Mäkinen, V. (2003). Sweepline the music! Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2598, 330–342. https://doi.org/10.1007/3-540-36477-3_25
Mendeley helps you to discover research relevant for your work.