dc.contributor.author |
Skiadopoulos, S |
en |
dc.contributor.author |
Sarkas, N |
en |
dc.contributor.author |
Sellis, T |
en |
dc.contributor.author |
Koubarakis, M |
en |
dc.date.accessioned |
2014-03-01T01:25:40Z |
|
dc.date.available |
2014-03-01T01:25:40Z |
|
dc.date.issued |
2007 |
en |
dc.identifier.issn |
1041-4347 |
en |
dc.identifier.uri |
https://dspace.lib.ntua.gr/xmlui/handle/123456789/17718 |
|
dc.subject |
Cone-based directional relations |
en |
dc.subject |
Inverse and composition operators |
en |
dc.subject |
Spatial databases and GIS |
en |
dc.subject.classification |
Computer Science, Artificial Intelligence |
en |
dc.subject.classification |
Computer Science, Information Systems |
en |
dc.subject.classification |
Engineering, Electrical & Electronic |
en |
dc.subject.other |
Composition operators |
en |
dc.subject.other |
Cone-based directional relations |
en |
dc.subject.other |
Spatial databases |
en |
dc.subject.other |
Computational methods |
en |
dc.subject.other |
Computer operating systems |
en |
dc.subject.other |
Geographic information systems |
en |
dc.subject.other |
Problem solving |
en |
dc.subject.other |
Relational database systems |
en |
dc.subject.other |
Mathematical models |
en |
dc.title |
A family of directional relation models for extended objects |
en |
heal.type |
journalArticle |
en |
heal.identifier.primary |
10.1109/TKDE.2007.1046 |
en |
heal.identifier.secondary |
http://dx.doi.org/10.1109/TKDE.2007.1046 |
en |
heal.language |
English |
en |
heal.publicationDate |
2007 |
en |
heal.abstract |
In this paper, we introduce a family of expressive models for qualitative spatial reasoning with directions. The proposed family is based on the cognitive plausible cone-based model. We formally define the directional relations that can be expressed in each model of the family. Then, we use our formal framework to study two interesting problems: computing the inverse of a directional relation and composing two directional relations. For the composition operator, in particular, we concentrate on two commonly used definitions, namely, consistency-based and existential composition. Our formal framework allows us to prove that our solutions are correct. The presented solutions are handled in a uniform manner and apply to all of the models of the family. © 2007 IEEE. |
en |
heal.publisher |
IEEE COMPUTER SOC |
en |
heal.journalName |
IEEE Transactions on Knowledge and Data Engineering |
en |
dc.identifier.doi |
10.1109/TKDE.2007.1046 |
en |
dc.identifier.isi |
ISI:000248223300009 |
en |
dc.identifier.volume |
19 |
en |
dc.identifier.issue |
8 |
en |
dc.identifier.spage |
1116 |
en |
dc.identifier.epage |
1129 |
en |