A new tractable subclass of the rectangle algebra

  • Authors:

  • P. Balbiani;J.-F. Condotta;L. Farinas Del Cerro

  • Affiliations:

  • Laboratoire d'informatique de Paris-Nord, Villetaneuse, France;Institut de recherche en informatique de Toulouse, Toulouse Cedex 4, France;Institut de recherche en informatique de Toulouse, Toulouse Cedex 4, France

  • Venue:
  • IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents the 169 permitted relations between two rectangles whose sides are parallel to the axes of some orthogonal basis in a 2-dimensional Euclidean space. Elaborating rectangle algebra just like interval algebra, it defines the concept of convexity as well as the ones of weak preconvexity and strong preconvexity. It introduces afterwards the fundamental operations of intersection, composition and inversion and demonstrates that the concept of weak preconvexity is preserved by the operation of composition whereas the concept of strong preconvexity is preserved by the operation of intersection. Finally, fitting the propagation techniques conceived to solve interval networks, it shows that the polynomial path-consistency algorithm is a decision method for the problem of proving the consistency of strongly preconvex rectangle networks.