Semi-automated derivation of conceptual neighborhood graphs of topological relations

1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Conceptual neighborhood graphs are similarity-based schemata of spatial/temporal relations. This paper proposes a semi-automated method for deriving a conceptual neighborhood graph of topological relations, which shows all pairs of relations between which a smooth transformation can be performed. The method is applicable to various sets of topological relations distinguished by the 9+-intersection. The method first identifies possible primitive-level transitions, combines those primitive-level transitions, and removes invalid combinations that do not satisfy some necessary conditions. As a demonstration, we develop conceptual neighborhood graphs of topological region-region relations in ℝ2, , and ℝ3 , topological relations between a directed line and a region in ℝ2 , and Allen's interval relations. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Kurata, Y. (2009). Semi-automated derivation of conceptual neighborhood graphs of topological relations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5756 LNCS, pp. 124–140). Springer Verlag. https://doi.org/10.1007/978-3-642-03832-7_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free