Algorithms for Hierarchical Spatial Reasoning

Papadias, D; Egenhofer, MJ

dc.contributor.author	Papadias, D	en
dc.contributor.author	Egenhofer, MJ	en
dc.date.accessioned	2014-03-01T01:45:53Z
dc.date.available	2014-03-01T01:45:53Z
dc.date.issued	1997	en
dc.identifier.issn	13846175	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/24768
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-0031421998&partnerID=40&md5=96daad7cca3d4532c0426f8f29988a5c	en
dc.subject	Direction relations	en
dc.subject	Geographic databases	en
dc.subject	Path consistency	en
dc.subject	Spatial reasoning	en
dc.subject.other	algorithm	en
dc.subject.other	geographical database	en
dc.subject.other	hierarchical reasoning	en
dc.subject.other	spatial reasoning	en
dc.title	Algorithms for Hierarchical Spatial Reasoning	en
heal.type	journalArticle	en
heal.publicationDate	1997	en
heal.abstract	In several applications, there is the need to reason about spatial relations using multiple local frames of reference that are hierarchically organized. This paper focuses on hierarchical reasoning about direction relations, a special class of spatial relations that describe order in space (e.g., north or northeast). We assume a spatial database of points and regions. Points belong to regions, which may recursively be parts of larger regions. The direction relations between points in the same region are explicitly represented (and not calculated from coordinates). Inference mechanisms are applied to extract direction relations between points located in different regions and to detect inconsistencies. We study two complementary types of inference. The first one derives the direction relation between points from the relations of their ancestor regions. The second type derives the relation through chains of common points using path consistency. We present algorithms for both types of inference and discuss their computational complexity.	en
heal.journalName	GeoInformatica	en
dc.identifier.volume	1	en
dc.identifier.issue	3	en
dc.identifier.spage	251	en
dc.identifier.epage	273	en