Abstract. This paper derives and compares two strategies for minimizing topological constraints in a query expressed by a visual example: (1) elimination of topological relations that are implied uniquely by composition and (2) restriction to topological relations that relate near-neighbor objects, as determined by a Delaunay triangulation. In both cases, the query processing approach is to solve a constraint satisfaction problem over a graph of binary topological relations. Individuals and the combination of the composition- and neighborhood-based strategies were implemented and compared with respect to their ability to reduce topological constraints, and with respect to the quality of the results obtained by a similarity-based searching that uses these preprocessing strategies. The main conclusion of this work is that similarity queries that are formulated in a visual language should exploit the metric characteristics of the configuration, even if only topological constraints are considered for making matches. 1
|
1540
|
Computational Geometry: An Introduction
– Preparata, Shamos
- 1985
|
|
877
|
Consistency in networks of relations
– Mackworth
- 1977
|
|
417
|
Multidimensional access methods
– Gaede, Gunther
- 1998
|
|
403
|
Computational geometry in C
– O'Rourke
- 1998
|
|
368
|
A spatial logic based on regions and connection
– Randell, Cui, et al.
- 1992
|
|
256
|
Point-set topological spatial relations
– Egenhofer, Franzosa
- 1991
|
|
177
|
On the calculus of relations
– Tarski
- 1941
|
|
158
|
The relative neighborhood graph of finite planar set
– Toussaint
- 1980
|
|
82
|
Reasoning about Gradual Changes of Topological Relationships
– Egenhofer, Al-Taha
- 1992
|
|
63
|
Spatial Databases with Application to GIS
– Rigaux, Scholl, et al.
- 2002
|
|
62
|
Query processing in Spatial-Query-by-Sketch
– Egenhofer
- 1997
|
|
47
|
Constraint satisfaction problems: An overview
– Meseguer
- 1989
|
|
37
|
Deriving the Composition of Binary Topological Relations
– Egenhofer
- 1994
|
|
35
|
Assessing the Consistency of Complete and Incomplete Topological Information
– EGENHOFER, SHARMA
- 1993
|
|
35
|
Algebraic approach to spatial reasoning
– SMITH, PARK
- 1992
|
|
28
|
On the Forward Checking Algorithm
– Bacchus, Grove
- 1995
|
|
26
|
Algorithms for Querying by Spatial Structure
– Papadias, Mamoulis, et al.
- 1998
|
|
16
|
Metric Details for Natural-Language Spatial Relations
– Egenhofer, Shariff
- 1998
|
|
15
|
Optimization Strategies for Spatial Query
– Aref, Samet
- 1991
|
|
11
|
On the Retrieval of Similar Configurations
– Papadias, Arkoumanis, et al.
- 1998
|
|
6
|
Content-Based Retrieval using Heuristic Search
– PAPADIAS, MANTZOUROGIANNIS, et al.
- 1999
|
|
6
|
Hierarchical Constraint Satisfaction in Spatial Databases
– Papadias, Kalnis, et al.
- 1999
|
|
4
|
LOBSTER: Combining AI and Database Techniques in GIS. Photogrametrmetric Engineering & Remote Sensing 56(1
– Egenhofer, Frank
- 1990
|
|
4
|
A Quantitative Description of Spatial Configurations
– Godoy, RodrÃguez
- 2002
|
|
3
|
Modeling Topological Relations: Strategies for Query Processing. Computers and Graphics
– Clementini, Sharma, et al.
- 1994
|
|
3
|
Some Algebras and Algorithms for Reasoning about Time and Space
– Maddux
- 1990
|
|
2
|
A Content-Based Approach to Searching Spatial Configurations
– Rodrguez, Godoy
- 2002
|
|
2
|
Early Separation Filter and Refinement
– Park, Lee, et al.
- 1999
|
|
2
|
Efficient Spatial Query Processing
– Kriegel, Brinkhoff, et al.
- 1993
|
|
1
|
Sketching Spatial Queries, Ph.D. Thesis
– Blaser
|
|
1
|
Egenhofer, M.: Distribution of Topological Relations
– Florence
- 1996
|
|
1
|
Relative Graph and their Relatives
– Jaramcyzk, Toussaint
- 1992
|
