Decomposition of geometrical constraint systems with reparameterization

Pascal Mathis (1) , Pascal Schreck (1) , Rémi Imbach (2)

1 LSIIT - Laboratoire des Sciences de l'Image, de l'Informatique et de la Télédétection
2 VEGAS - Effective Geometric Algorithms for Surfaces and Visibility

Decomposition of constraint systems is a key component of geometric constraint solving in CAD. On the other hand, some authors have introduced the notion of reparameterization which aims at helping the solving of indecomposable systems by replacing some geometric constraints by other ones. In previous works, the minimal change of the initial system is a main criterion. We propose to marry these two ingredients, decomposition and reparameterization, in a method able to reparameterize and to decompose a constraint system according to this reparameterization. As a result, we do not aim at minimizing the number of added constraints during the reparameterization, but we want to decompose the system such that each component owns a minimal number of such added constraints.

Domaines: Ingénierie assistée par ordinateur

Pascal Mathis, Pascal Schreck, Rémi Imbach. Decomposition of geometrical constraint systems with reparameterization. SAC '12 - Proceedings of the 27th Annual ACM Symposium on Applied Computing, Mar 2012, Trento, France. pp.102-108, ⟨10.1145/2245276.2245298⟩. ⟨hal-02077922⟩