Consistency checking for Euclidean spatial constraints

A dimension graph approach

Xuan Liu, S. Shekhar, Sanjay Chawla

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

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(N2) when the number of predicates is much smaller than N2 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.

Original languageEnglish
Title of host publicationProceedings - International Conference on Tools with Artificial Intelligence, ICTAI
PublisherIEEE Computer Society
Pages333-342
Number of pages10
Volume2000-January
ISBN (Print)0769509096
DOIs
Publication statusPublished - 2000
Externally publishedYes
Event12th IEEE Internationals Conference on Tools with Artificial Intelligence, ICTAI 2000 - Vancouver, Canada
Duration: 13 Nov 200015 Nov 2000

Other

Other12th IEEE Internationals Conference on Tools with Artificial Intelligence, ICTAI 2000
CountryCanada
CityVancouver
Period13/11/0015/11/00

Keywords

  • Astronomy
  • Computer science
  • Contracts
  • Decision support systems
  • Fluid flow
  • Geography
  • Laboratories
  • Relational databases
  • Spatial databases
  • Urban planning

ASJC Scopus subject areas

  • Software
  • Artificial Intelligence
  • Computer Science Applications

Cite this

Liu, X., Shekhar, S., & Chawla, S. (2000). Consistency checking for Euclidean spatial constraints: A dimension graph approach. In Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI (Vol. 2000-January, pp. 333-342). [889891] IEEE Computer Society. https://doi.org/10.1109/TAI.2000.889891

Consistency checking for Euclidean spatial constraints : A dimension graph approach. / Liu, Xuan; Shekhar, S.; Chawla, Sanjay.

Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI. Vol. 2000-January IEEE Computer Society, 2000. p. 333-342 889891.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Liu, X, Shekhar, S & Chawla, S 2000, Consistency checking for Euclidean spatial constraints: A dimension graph approach. in Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI. vol. 2000-January, 889891, IEEE Computer Society, pp. 333-342, 12th IEEE Internationals Conference on Tools with Artificial Intelligence, ICTAI 2000, Vancouver, Canada, 13/11/00. https://doi.org/10.1109/TAI.2000.889891
Liu X, Shekhar S, Chawla S. Consistency checking for Euclidean spatial constraints: A dimension graph approach. In Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI. Vol. 2000-January. IEEE Computer Society. 2000. p. 333-342. 889891 https://doi.org/10.1109/TAI.2000.889891
Liu, Xuan ; Shekhar, S. ; Chawla, Sanjay. / Consistency checking for Euclidean spatial constraints : A dimension graph approach. Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI. Vol. 2000-January IEEE Computer Society, 2000. pp. 333-342
@inproceedings{d341d5723a7b458083108013dd2618d7,
title = "Consistency checking for Euclidean spatial constraints: A dimension graph approach",
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(N2) when the number of predicates is much smaller than N2 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.",
keywords = "Astronomy, Computer science, Contracts, Decision support systems, Fluid flow, Geography, Laboratories, Relational databases, Spatial databases, Urban planning",
author = "Xuan Liu and S. Shekhar and Sanjay Chawla",
year = "2000",
doi = "10.1109/TAI.2000.889891",
language = "English",
isbn = "0769509096",
volume = "2000-January",
pages = "333--342",
booktitle = "Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI",
publisher = "IEEE Computer Society",

}

TY - GEN

T1 - Consistency checking for Euclidean spatial constraints

T2 - A dimension graph approach

AU - Liu, Xuan

AU - Shekhar, S.

AU - Chawla, Sanjay

PY - 2000

Y1 - 2000

N2 - 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(N2) when the number of predicates is much smaller than N2 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.

AB - 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(N2) when the number of predicates is much smaller than N2 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.

KW - Astronomy

KW - Computer science

KW - Contracts

KW - Decision support systems

KW - Fluid flow

KW - Geography

KW - Laboratories

KW - Relational databases

KW - Spatial databases

KW - Urban planning

UR - http://www.scopus.com/inward/record.url?scp=84949640394&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84949640394&partnerID=8YFLogxK

U2 - 10.1109/TAI.2000.889891

DO - 10.1109/TAI.2000.889891

M3 - Conference contribution

SN - 0769509096

VL - 2000-January

SP - 333

EP - 342

BT - Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI

PB - IEEE Computer Society

ER -