Qualitative direction calculi with arbitrary granularity

Jochen Renz; Debasis Mitra

doi:10.1007/978-3-540-28633-2_9

Qualitative direction calculi with arbitrary granularity

Jochen Renz, Debasis Mitra

Research output: Contribution to journal › Conference article › peer-review

105 Citations (Scopus)

Abstract

Binary direction relations between points in two-dimensional space are the basis to any qualitative direction calculus. Previous calculi are only on a very low level of granularity. In this paper we propose a generalization of previous approaches which enables qualitative calculi with an arbitrary level of granularity. The resulting calculi are so powerful that they can even emulate a quantitative representation based on a coordinate system. We also propose a less powerful, purely qualitative version of the generalized calculus. We identify tractable subsets of the generalized calculus and describe some applications for which these calculi are useful.

Original language	English
Pages (from-to)	65-74
Number of pages	10
Journal	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	3157
DOIs	https://doi.org/10.1007/978-3-540-28633-2_9
Publication status	Published - 2004
Externally published	Yes
Event	8th Pacific Rim International Conference on Artificial Intelligence, PRICAI 2004: Trends in Artificial Intelligence - Auckland, New Zealand Duration: 9 Aug 2004 → 13 Aug 2004

Access to Document

10.1007/978-3-540-28633-2_9

Cite this

@article{d488c4f01b134122b44ce6bec74886ce,

title = "Qualitative direction calculi with arbitrary granularity",

abstract = "Binary direction relations between points in two-dimensional space are the basis to any qualitative direction calculus. Previous calculi are only on a very low level of granularity. In this paper we propose a generalization of previous approaches which enables qualitative calculi with an arbitrary level of granularity. The resulting calculi are so powerful that they can even emulate a quantitative representation based on a coordinate system. We also propose a less powerful, purely qualitative version of the generalized calculus. We identify tractable subsets of the generalized calculus and describe some applications for which these calculi are useful.",

author = "Jochen Renz and Debasis Mitra",

year = "2004",

doi = "10.1007/978-3-540-28633-2_9",

language = "English",

volume = "3157",

pages = "65--74",

journal = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

issn = "0302-9743",

publisher = "Springer Verlag",

note = "8th Pacific Rim International Conference on Artificial Intelligence, PRICAI 2004: Trends in Artificial Intelligence ; Conference date: 09-08-2004 Through 13-08-2004",

}

TY - JOUR

T1 - Qualitative direction calculi with arbitrary granularity

AU - Renz, Jochen

AU - Mitra, Debasis

PY - 2004

Y1 - 2004

N2 - Binary direction relations between points in two-dimensional space are the basis to any qualitative direction calculus. Previous calculi are only on a very low level of granularity. In this paper we propose a generalization of previous approaches which enables qualitative calculi with an arbitrary level of granularity. The resulting calculi are so powerful that they can even emulate a quantitative representation based on a coordinate system. We also propose a less powerful, purely qualitative version of the generalized calculus. We identify tractable subsets of the generalized calculus and describe some applications for which these calculi are useful.

AB - Binary direction relations between points in two-dimensional space are the basis to any qualitative direction calculus. Previous calculi are only on a very low level of granularity. In this paper we propose a generalization of previous approaches which enables qualitative calculi with an arbitrary level of granularity. The resulting calculi are so powerful that they can even emulate a quantitative representation based on a coordinate system. We also propose a less powerful, purely qualitative version of the generalized calculus. We identify tractable subsets of the generalized calculus and describe some applications for which these calculi are useful.

UR - http://www.scopus.com/inward/record.url?scp=22944458853&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-28633-2_9

DO - 10.1007/978-3-540-28633-2_9

M3 - Conference article

AN - SCOPUS:22944458853

SN - 0302-9743

VL - 3157

SP - 65

EP - 74

JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

T2 - 8th Pacific Rim International Conference on Artificial Intelligence, PRICAI 2004: Trends in Artificial Intelligence

Y2 - 9 August 2004 through 13 August 2004

ER -

Qualitative direction calculi with arbitrary granularity

Abstract

Access to Document

Other files and links

Fingerprint

Cite this