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. © Springer-Verlag Berlin Heidelberg 2004.
CITATION STYLE
Renz, J., & Mitra, D. (2004). Qualitative direction calculi with arbitrary granularity. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 3157, pp. 65–74). Springer Verlag. https://doi.org/10.1007/978-3-540-28633-2_9
Mendeley helps you to discover research relevant for your work.