An Efficient Algorithm for Generating Composition Tables For: Qualitative Spatial Relations

Abstract

Qualitative Spatial Reasoning (QSR) is useful for deriving logical inferences when quantitative spatial information is not pertinent or not available. the automated derivation of such logical inferences becomes a binary constraint satisfaction problem; binary relations can be formulated as a region-Based qualitative reasoning problem involving disjunctive constraints. It has been proved [1] that composition-Based reasoning is complete for deriving inferences in various calculi; hence a composition table is a central part of QSR and consistency-checking. Previously developed algorithms to construct such tables have required manual or, at best, semi-automatic analysis. Herein we present a new divideand- conquer algorithm to automatically construct a composition table for spatial relations, and apply it to the 3D region connection calculus, VRCC3D+. This validates the hypothesis that consistency-checking, entailment checking, and occlusion can be supported in 3D. Copyright © 2012 by International Society of Computers and their Applications (ISCA).

Department(s)

Computer Science

International Standard Book Number (ISBN)

978-188084388-8

Document Type

Article - Conference proceedings

Document Version

Citation

File Type

text

Language(s)

English

Rights

© 2024 Curran Associates, Inc., All rights reserved.

Publication Date

01 Dec 2012

This document is currently not available here.

Share

 
COinS