A C-tree decomposition algorithm for 2D and 3D geometric constraint solving

In this paper, we propose a method which can be used to decompose a 2D or 3D constraint problem into a C-tree. With this decomposition, a geometric constraint problem can be reduced into basic merge patterns, which are the smallest problems we need to solve in order to solve the original problem in certain sense. Based on the C-tree decomposition algorithm, we implemented a software package MMP/Geometer. Experimental results show that MMP/Geometer finds the smallest decomposition for all the testing examples efficiently.

[1]  Ashok V. Kumar,et al.  Sequential constraint imposition for dimension-driven solid models , 2001, Comput. Aided Des..

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

[3]  D. Ross.  Computer-aided design , 1961, CACM.

[4]  D. Du,et al.  Computing in Euclidean Geometry , 1995 .

[5]  Dongming Wang,et al.  Automated Deduction in Geometry , 1996, Lecture Notes in Computer Science.

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

[7]  Bhaskar Dasgupta,et al.  The Stewart platform manipulator: a review , 2000 .

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

[9]  Christoph M. Hoffmann,et al.  A Systematic Framework for Solving Geometric Constraints Analytically , 2000, J. Symb. Comput..

[10]  Kun Jiang,et al.  A Hybrid Method for Solving Geometric Constraint Problems , 2000, Automated Deduction in Geometry.

[11]  John C. Owen,et al.  The Nonsolvability by Radicals of Generic 3-connected Planar Graphs , 2002, Automated Deduction in Geometry.

[12]  Christoph M. Hoffmann,et al.  GEOMETRIC CONSTRAINT SOLVING IN ℜ2 AND ℜ3 , 1995 .

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

[14]  Xiao-Shan Gao,et al.  Geometric constraint satisfaction using optimization methods , 1999, Comput. Aided Des..

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

[16]  Dominique Michelucci,et al.  Qualitative Study of Geometric Constraints , 1998 .

[17]  David Podgorelec,et al.  A new constructive approach to constraint-based geometric design , 2002, Comput. Aided Des..

[18]  Pascal Schreck,et al.  Geometric Construction by Assembling Solved Subfigures , 1998, Artif. Intell..

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

[20]  Xiao-Shan Gao,et al.  Generalized Stewart-Gough platforms and their direct kinematics , 2005, IEEE Transactions on Robotics.

[21]  Glenn A. Kramer.  Solving geometric constraint systems a case study in kinematics , 1992, Comput. Aided Des..

[22]  Gilles Trombettoni,et al.  A New Structural Rigidity for Geometric Constraint Systems , 2002, Automated Deduction in Geometry.

[23]  Christoph M. Hoffmann,et al.  A graph-constructive approach to solving systems of geometric constraints , 1997, TOGS.

[24]  Robert Joan-Arinyo,et al.  Geometric Constraint Solving , 2003 .

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

[26]  Xiao-Shan Gao,et al.  Classification and solving of merge patterns in geometric constraint solving , 2003, 2003 Shape Modeling International..

[27]  Sebastià Vila-Marta,et al.  Transforming an under-constrained geometric constraint problem into a well-constrained one , 2003, SM '03.

[28]  Shi-Min Hu,et al.  A constructive approach to solving 3-D geometric constraint systems using dependence analysis , 2002, Comput. Aided Des..

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

[30]  Christoph M. Hoffmann,et al.  Variable-radius circles of cluster merging in geometric constraints: I. Translational clusters , 2002, Comput. Aided Des..

[31]  Christoph M. Hoffmann,et al.  Decomposition Plans for Geometric Constraint Systems, Part I: Performance Measures for CAD , 2001, J. Symb. Comput..

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

[33]  K. Kondo,et al.  Algebraic method for manipulation of dimensional relationships in geometric models , 1992, Comput. Aided Des..

[34]  Kwangsoo Kim,et al.  Geometric reasoning for knowledge-based parametric design using graph representation , 1996, Comput. Aided Des..

[35]  Xiao-Shan Gao,et al.  Geometric constraint solving via C-tree decomposition , 2003, SM '03.

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

[37]  Sebastià Vila-Marta,et al.  Revisiting decomposition analysis of geometric constraint graphs , 2002, SMA '02.

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