The Retrieval of Direction Relations using R-trees

DSpace/Manakin Repository

Show simple item record

dc.contributor.author Papadias, D en
dc.contributor.author Theodoridis, Y en
dc.contributor.author Sellis, T en
dc.date.accessioned 2014-03-01T02:48:15Z
dc.date.available 2014-03-01T02:48:15Z
dc.date.issued 1994 en
dc.identifier.uri http://hdl.handle.net/123456789/33664
dc.subject Minimum Bounding Rectangle en
dc.title The Retrieval of Direction Relations using R-trees en
heal.type conferenceItem en
heal.identifier.primary 10.1007/3-540-58435-8_182 en
heal.identifier.secondary http://dx.doi.org/10.1007/3-540-58435-8_182 en
heal.publicationDate 1994 en
heal.abstract R-trees and related structures, like R+-trees and R*-trees, have been used to answer queries involving topological information about objects represented by their minimum bounding rectangles (MBRs). This paper describes how the R-tree method can be used for the storage and retrieval of direction relations. Direction relations deal with order in space, as for instance, left, above, north, southeast etc. In en
heal.journalName Database and Expert Systems Applications en
dc.identifier.doi 10.1007/3-540-58435-8_182 en

Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record