TY - JOUR
AB - Direction relations between extended spatial objects are important commonsense knowledge. Recently, Goyal and Egenhofer proposed a relation model, known as the cardinal direction calculus (CDC), for representing direction relations between connected plane regions. The CDC is perhaps the most expressive qualitative calculus for directional information, and has attracted increasing interest from areas such as artificial intelligence, geographical information science, and image retrieval. Given a network of CDC constraints, the consistency problem is deciding if the network is realizable by connected regions in the real plane. This paper provides a cubic algorithm for checking the consistency of complete networks of basic CDC constraints, and proves that reasoning with the CDC is in general an NP-complete problem. For a consistent complete network of basic CDC constraints, our algorithm returns a 'canonical' solution in cubic time. This cubic algorithm is also adapted to check the consistency of complete networks of basic cardinal constraints between possibly disconnected regions. © 2010 Elsevier B.V. All rights reserved.
AU - Liu, W
AU - Zhang, X
AU - Li, S
AU - Ying, M
DA - 2010/08/01
DO - 10.1016/j.artint.2010.05.006
EP - 983
JO - Artificial Intelligence
PY - 2010/08/01
SP - 951
TI - Reasoning about cardinal directions between extended objects
VL - 174
Y1 - 2010/08/01
Y2 - 2019/07/24
ER -