Spatial relations, minimum bounding rectangles, and spatial data structures

Papadias, D; Theodoridis, Y

dc.contributor.author	Papadias, D	en
dc.contributor.author	Theodoridis, Y	en
dc.date.accessioned	2014-03-01T01:13:24Z
dc.date.available	2014-03-01T01:13:24Z
dc.date.issued	1997	en
dc.identifier.issn	1365-8816	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/12453
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-0030800230&partnerID=40&md5=012d29bb67382e059ac3ddfb45ae43b0	en
dc.subject.classification	Computer Science, Information Systems	en
dc.subject.classification	Geography	en
dc.subject.classification	Geography, Physical	en
dc.subject.classification	Information Science & Library Science	en
dc.subject.other	spatial relation	en
dc.subject.other	spatial structure	en
dc.subject.other	topology	en
dc.title	Spatial relations, minimum bounding rectangles, and spatial data structures	en
heal.type	journalArticle	en
heal.language	English	en
heal.publicationDate	1997	en
heal.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. © 1997 Taylor & Francis Ltd.	en
heal.publisher	TAYLOR & FRANCIS LTD	en
heal.journalName	International Journal of Geographical Information Science	en
dc.identifier.isi	ISI:A1997WM87800001	en
dc.identifier.volume	11	en
dc.identifier.issue	2	en
dc.identifier.spage	111	en
dc.identifier.epage	138	en