Advanced Search
CS Search Google Search
Subscribers, please login

Published Articles >> Table of Contents >> Abstract

12th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'00)   p. 0333
Consistency checking for Euclidean spatial constraints: a dimension graph approach

Full Article Text: Download PDF of full textBuy this articleGet full text from IEEE Xplore

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TAI.2000.889891
Send link to a friend

Abstract
Abstract: In this paper, we address the problem of consistency checking for Euclidean spatial constraints. A dimension graph representation is proposed to maintain the Euclidean spatial constraints among objects. The basic idea is to project the spatial constraints on both X and Y dimensions, and to construct a dimension graph on each dimension. Using a dimension graph representation transforms the problem of consistency checking into the problem of graph cycle detection. Consistency checking can be achieved with O(N+E) time as well as space complexity, where N is the number of spatial objects, and E is the number of spatial predicates in the constraint. The proposed approach is faster than O(N/sup 2/) when the number of predicates is much smaller than N/sup 2/ and there are few disjunctions in the spatial constraint. The dimension graph and consistency checking algorithm can be used for points, intervals and polygons in two-dimensional space. The algorithm can also guarantee global consistency.
Additional Information
Index Terms- computational complexity; computational geometry; transforms; consistency checking; Euclidean spatial constraints; dimension graph approach; graph cycle detection; space complexity; spatial objects; spatial predicates; intervals; polygons; two-dimensional space

Citation:  Xuan Liu, S. Shekhar, S. Chawla, "Consistency checking for Euclidean spatial constraints: a dimension graph approach," ictai, p. 0333,  12th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'00),  2000

Similar Articles

Abstract Contents
Abstract
Index Terms
Citation




Free access to

  • Abstracts
  • Selected PDFs

Electronic subscribers login to:

  • Access HTML/PDFs of full text articles

Subscription information

Get a Web account

PDFs require Adobe Acrobat Reader.

Peer Review Notice

Give us Feedback