Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/1408
Title: Qualitative Polyline Similarity Testing With Applications To Query-By-Sketch, Indexing And Classification
Authors: KUIJPERS, Bart 
MOELANS, Bart 
Van de Weghe, N
Issue Date: 2006
Publisher: ACM.Press
Source: de By, Rolf A. & Nittel, Silvia (Ed.) Proceedings of the 14th ACM International Symposium on Geographic Information Systems, ACM-GIS 2006. p. 11-18.
Abstract: We present an algorithm for polyline (and polygon) similarity testing that is based on the double-cross formalism. To determine the degree of similarity between two polylines, the algorithm first computes their generalized polygons, that consist of almost equally long line segments and that approximate the length of the given polylines within an ε-error margin. Next, the algorithm determines the double-cross matrices of the generalized polylines and the difference between these matrices is used as a measure of dissimilarity between the given polylines. We prove termination of our algorithm and show that its sequential time complexity is bounded by O“(max(N1,N2) ε )2”, where N1 and N2 are the number of vertices of the given polylines. We apply our method to query-by-sketch, indexing of polyline databases, and classification of terrain features and show experimental results for each of these applications.
Keywords: GIS, polygon similarity
Document URI: http://hdl.handle.net/1942/1408
ISBN: 1-59593-529-0
DOI: 10.1145/1183471.1183475
Category: C1
Type: Proceedings Paper
Appears in Collections:Research publications

Files in This Item:
File Description SizeFormat 
paperGIS-KMV.pdfPostprint294.33 kBAdobe PDFView/Open
Show full item record

SCOPUSTM   
Citations

13
checked on Sep 2, 2020

Page view(s)

46
checked on May 20, 2022

Download(s)

138
checked on May 20, 2022

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.