Spatial relations, minimum bounding rectangles, and spatial data structures

International Journal of Geographical Information Science

Volumn 11, Issue 2, 1997, Pages 111-138

  Papadias, Dimitris ^a   Theodoridis, Yannis ^b  

^a University of Maine   (United States)

^b NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

SPATIAL RELATION; SPATIAL STRUCTURE; TOPOLOGY;

EID: 0030800230     PISSN: 13658816     EISSN: 13623087     Source Type: Journal    
DOI: 10.1080/136588197242428     Document Type: Article

References (4)

1. Beckmann, N., Kriegel, H. P., Schneider, R., and Seeger, B., The R*-tree:an e? cient and robust access method for points and rectangles. In Proceedings of the AC M Conference on the Modelling of Data (SIG MOD). pp. 322–331. New York:ACM Press Ltd.
2. Brinkhoff, T., Kriegel, H. P., and Schneider, R., Comparison of approximations of complex objects used for approximation-based query processing in spatial database systems. In Proceedings of 9th International Conference on Data Engineering. pp. 40–49. Los Alamitos:I.E.E.G. Computer Society.
3. Brinkhoff, T., Horn, H., Kriegel, H. P., and Schneider, R., A storage and access architecture for e? cient query processing in spatial database systems. In Proceedings of the Third Symposium on Large Spatial Databases (SSD). pp. 357–376. Berlin:Springer Verlag.
4. Allen, J. F., 1983. “ Maintaining knowledge about temporal intervals ”. In Communications of AC M 832–843.