DMCA
Spatial Relations, Minimum Bounding Rectangles, and Spatial Data Structures (1997)
Cached
Download Links
- [ftp.dbnet.ece.ntua.gr]
- [ftp.dbnet.ece.ntua.gr]
- DBLP
Other Repositories/Bibliography
| Venue: | International Journal of Geographic Information Science |
| Citations: | 65 - 13 self |
BibTeX
@ARTICLE{Papadias97spatialrelations,,
author = {Dimitris Papadias and Yannis Theodoridis},
title = {Spatial Relations, Minimum Bounding Rectangles, and Spatial Data Structures},
journal = {International Journal of Geographic Information Science},
year = {1997},
volume = {11},
pages = {111--138}
}
Share
 |
 |
 |
 |
||
OpenURL
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 minimise the number of disk accesses for queries involving topological and direction relations. We also investigate queries that express complex spatial conditions in the form of disjunctions and conjunctions, and we discuss possible extensions.
