Sciweavers

2 search results - page 1 / 1
» Double-Crossing: Decidability and Computational Complexity o...
Sort
View
COSIT
2001
Springer
158views GIS» more  COSIT 2001»
13 years 9 months ago
Double-Crossing: Decidability and Computational Complexity of a Qualitative Calculus for Navigation
Abstract. The Double Cross calculus has been proposed for the purpose of navigation based on qualitative information about spatial configurations. Up until now, however, no result...
Alexander Scivos, Bernhard Nebel
GIS
2006
ACM
13 years 5 months ago
Qualitative polyline similarity testing with applications to query-by-sketch, indexing and classification
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...
Bart Kuijpers, Bart Moelans, Nico Van de Weghe