Optimal contractor for n-gons constraint
Résumé
This paper presents an optimal method for contracting a n-gons Constraints Satisfaction Problem (CSP), composed of n > 2 domains and distance constraints. This contribution takes into account all constraints globally, unlike existing interval analysis approaches, and focuses on the edges of the CSP boxes, rather than on their entirety, to compute the smallest boxes enclosing the CSP solution. It is based on constraint propagation, interval analysis tools and some properties of the boundary solution of the n-gons CSP.
