Aiding design with constraints: an extension of quad trees in order to deal with piecewise functions

This paper deals with aiding preliminary design when considered as a constraint satisfaction problem (CSP). In this case, constraint filtering techniques provide some kind of interactive assistance to the designer. However, some kinds of numerical constraints corresponding with numerical relations cannot be filtered precisely with classical analytical filtering techniques such as interval arithmetic or box-consistency; it is therefore necessary to discretize them in order to include them in the CSP. To this end, quad trees (QT) have been proposed for binary constraints, or 2k trees when more than two variables are considered; but QT assume that a constraint must be defined by a single numerical function. The aim of this paper is to show that QT techniques can be extended when a constraint is defined by a piecewise function or by a set of numerical functions defined on intervals. The first section recalls some basics relevant to the preliminary design problem and the interests of the CSP assistance. The second section presents the principles of the QT. The last section describes our contributions relevant to QT extensions dealing with piecewise functions.