A formalization of geometric constraint systems and their decomposition

Pascal Mathis (1, 2) , Simon E. B. Thierry (1, 2)

1 UNISTRA - Université de Strasbourg
2 LSIIT - Laboratoire des Sciences de l'Image, de l'Informatique et de la Télédétection

For more than a decade, the trend in geometric constraint systems solving has been to use a geometric decomposition/recombination approach. These methods are generally grounded on the invariance of systems under rigid motions. In order to decompose further, other invariance groups (e.g., scalings) have recently been considered. Geometric decomposition is grounded on the possibility to replace a solved subsystem with a smaller system called . This article shows the central property that justifies decomposition, without assuming specific types of constraints or invariance groups. The exact nature of the boundary system is given. This formalization brings out the elements of a general and modular implementation.

Mots clés: Geometric constraints solving; Decomposition; Transformation groups; Parametric CAD; Formalization

Pascal Mathis, Simon E. B. Thierry. A formalization of geometric constraint systems and their decomposition. Formal Aspects of Computing, 2009, 22 (2), pp.129-151. ⟨10.1007/s00165-009-0117-8⟩. ⟨hal-00534926⟩