Decomposition of geometrical constraint systems with reparameterization

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.

[1]  Xiao-Shan Gao,et al.  A C-tree decomposition algorithm for 2D and 3D geometric constraint solving , 2006, Comput. Aided Des..

[2]  Dieter Roller,et al.  Rule-oriented method for parameterized computer-aided design , 1992, Comput. Aided Des..

[3]  Simon E. B. Thierry,et al.  A formalization of geometric constraint systems and their decomposition , 2009, Formal Aspects of Computing.

[4]  J. C. Owen,et al.  Algebraic solution for geometry from dimensional constraints , 1991, SMA '91.

[5]  Gui-Fang Zhang.  Well-constrained completion for under-constrained geometric constraint problem based on connectivity analysis of graph , 2011, SAC '11.

[6]  Pascal Schreck,et al.  Tracking Method for Reparametrized Geometrical Constraint Systems , 2011, 2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing.

[7]  Pascal Schreck,et al.  Extensions of the witness method to characterize under-, over- and well-constrained geometric constraint systems , 2011, Comput. Aided Des..

[8]  Christoph M. Hoffmann,et al.  Decomposition Plans for Geometric Constraint Problems, Part II: New Algorithms , 2001, J. Symb. Comput..

[9]  Wenjun Wu,et al.  Basic principles of mechanical theorem proving in elementary geometries , 1986, Journal of Automated Reasoning.

[10]  B. Aldefeld.  Variation of geometrics based on a geometric-reasoning method , 1988 .

[11]  Beat D. Brüderlin,et al.  Using geometric rewrite rules for solving geometric problems symbolically , 1993, Theor. Comput. Sci..

[12]  S. Chou.  Mechanical Geometry Theorem Proving , 1987 .

[13]  Sebti Foufou,et al.  Using Cayley Menger Determinants , 2004 .

[14]  Pascal Schreck,et al.  Combining symbolic and numerical solvers to simplify indecomposable systems solving , 2008, SAC '08.

[15]  Christoph M. Hoffmann,et al.  Geometric constraint solver , 1995, Comput. Aided Des..

[16]  Meera Sitharam,et al.  Characterizing 1-dof Henneberg-I graphs with efficient configuration spaces , 2009, SAC '09.

[17]  David C. Gossard,et al.  Variational geometry in computer-aided design , 1981, SIGGRAPH '81.

[18]  Pascal Schreck,et al.  Formal resolution of geometrical constraint systems by assembling , 1997, SMA '97.

[19]  Xiao-Shan Gao,et al.  Solving spatial basic geometric constraint configurations with locus intersection , 2004, Comput. Aided Des..

[20]  Dominique Michelucci,et al.  Solving geometric constraints by homotopy , 1995, IEEE Trans. Vis. Comput. Graph..

[21]  Robert Joan-Arinyo,et al.  A correct rule-based geometric constraint solver , 1997, Comput. Graph..

[22]  Christoph M. Hoffmann,et al.  Finding Solvable Subsets of Constraint Graphs , 1997, CP.

[23]  Gilles Trombettoni,et al.  Decomposition of Geometric Constraint Systems: a Survey , 2006, Int. J. Comput. Geom. Appl..

[24]  Alan E. Middleditch,et al.  Connectivity analysis: a tool for processing geometric constraints , 1996, Comput. Aided Des..