Spatial relations, minimum bounding rectangles, and spatial data structures
- 1 March 1997
- journal article
- research article
- Published by Taylor & Francis in International Journal of Geographical Information Science
- Vol. 11 (2) , 111-138
- https://doi.org/10.1080/136588197242428
Abstract
Spatial relations are important in numerous domains, such as Spatial Query Languages, Image and Multimedia Databases, Reasoning and Geographic Applications. This paper is concerned with the retrieval of topological and direction relations using spatial data structures based on Minimum Bounding Rectangles. We describe topological and direction relations between region objects and we study the spatial information that Minimum Bounding Rectangles convey about the actual objects they enclose. Then we apply the results in R-trees and their variations, R-trees and R*-trees, in order to minimize the number of disk accesses for queries involving topological and direction relations. We also investigate queries that express complex conditions in the form of disjunctions and conjunctions, and discuss possible extensions.Keywords
This publication has 3 references indexed in Scilit:
- Comparison of approximations of complex objects used for approximation-based query processing in spatial database systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A storage and access architecture for efficient query processing in spatial database systemsPublished by Springer Nature ,1993
- The R*-tree: an efficient and robust access method for points and rectanglesACM SIGMOD Record, 1990