• Corpus ID: 767629

# Oriented Straight Line Segment Algebra: Qualitative Spatial Reasoning about Oriented Objects

@article{Moratz2009OrientedSL,
title={Oriented Straight Line Segment Algebra: Qualitative Spatial Reasoning about Oriented Objects},
author={Reinhard Moratz and Dominik L{\"u}cke and Till Mossakowski},
journal={ArXiv},
year={2009},
volume={abs/0912.5533}
}
• Published 30 December 2009
• Computer Science
• ArXiv
Nearly 15 years ago, a set of qualitative spatial relations between oriented straight line segments (dipoles) was suggested by Schlieder. This work received substantial interest amongst the qualitative spatial reasoning community. However, it turned out to be difficult to establish a sound constraint calculus based on these relations. In this paper, we present the results of a new investigation into dipole constraint calculi which uses algebraic methods to derive sound results on the…
A new approach is introduced for calculating the composition table for DRAf using condensed semantics, that performs far better than algebraic closure, and investigates morphisms between qualitative spatial calculi.
This work applies universal algebraic tools to binary qualitative calculi and their relations to find a better match with human concepts related to natural language and better efficiency for reasoning.
• Mathematics
IJCAI
• 2015
This work considers notions of qualitative constraint calculus, of homomorphism between calculi, and of quotient of calculi and derives important properties for spatial calculi from corresponding properties of related calculi.
• Computer Science
MICAI
• 2015
It is shown in an empirical evaluation that performing sketch-to-metric map alignment with the new representation of the “left/right” relations is more effective than using the original $$\mathcal {DRA}$$ calculi.
• Computer Science
ArXiv
• 2010
This paper presents simple geometric rules that enable reasoning about relative direction between oriented points that have a scalable granularity m, and develops a simple algorithm for computing the OPRA_m composition tables and proves its correctness.
In this paper we introduce a method for extending binary qualitative direction calculi with adjustable granularity like OPRAmor the star calculus with a granular distance concept. This method is
This paper combines the DRA and CYC algebras into a new calculus for reasoning within network structures, and proves some interesting results about some properties of the standard operations, converse and composition, for versions of CYC and DRA.
• Computer Science
Journal of Geographical Systems
• 2021
The results show that by considering the specific conditions (not availability of descriptive data of routes and geometric/descriptive information of landmarks), this paper has been able to take an important step toward finding an acceptable solution for the matching problem.

## References

SHOWING 1-10 OF 67 REFERENCES

• Computer Science
ECAI
• 2000
A novel approach for dealing with intrinsic orientation information by specifying qualitative relations between oriented line segments, the simplest possible spatial entities being extended and having an intrinsic direction is presented.
• Computer Science
Spatial Cognition
• 2004
The main result of the paper is the identification of a maximally refined calculus amongst the practical natural RST calculi, which turns out to be very similar to Ligozat's flip-flop calculus.
This paper presents a systematic way of defining qualitative calculi for spatial reasoning, which allows for in a general setting the notions of coarse and fine inference, as well as the conceptual neighborhood properties of sets of spatial relations.
• Computer Science
Applied Intelligence
• 2004
The paper presents the basic iconic notation for spatial orientation relations that exploits the structure of the spatial domain and explores a variety of ways in which these relations can be manipulated and combined for spatial reasoning.
A new calculus about oriented points is introduced which has a scalable granularity and can generate the minimal composition table, and the algebraic closure for a set of $\mathcal{OPRA}$ statements is sufficient to solve knowledge integration tasks in robotics.
An algebraic method is used to formalize the meaning of cardinal directions and two examples of systems to determine and reason with cardinal directions are discussed in some detail and results from a prototype are given.
A system of line segment relations which generalizes Allen's system of interval relations to two dimensions is introduced and it is shown that this generalization differs in interesting properties from the generalizations based on topological relations which have been proposed so far.
• Mathematics
PRICAI
• 2004
It is shown that the natural algebraic object governing this kind of calculus is a non-associative algebra (in the sense of Maddux), and that the notion of weak representation is the right notion for describing most basic properties.