A constructive approach to solving 3-D geometric constraint systems using dependence analysis

Solving geometric constraint systems in 3-D is much more complicated than that in 2-D because the number of variables is larger and some of the results valid in 2-D cannot be extended for 3-D. In this paper, we propose a new DOF-based graph constructive method to geometric constraint systems solving that can efficiently handle well-, over- and under-constrained systems based on the dependence analysis. The basic idea is that the solutions of some geometric elements depend on some others because of the constraints between them. If some geometric elements depend on each other, they must be solved together. In our approach, we first identify all structurally redundant constraints, then we add some constraints to well constrain the system. And we prove that the order of a constraint system after processing under-constrained cases is not more than that of the original system multiplied by 5. After that, we apply a recursive searching process to identify all the clusters, which is shown to be capable of getting the minimum order-reduction result of a well-constrained system. We also briefly describe the constraint evaluation phase and show the implementation results of our method.

[1]  I. Duff,et al.  Direct Methods for Sparse Matrices , 1987 .

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

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

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

[5]  L. Foulds Graph Theory Applications , 1991 .

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

[7]  Xiao-Shan Gao,et al.  Solving geometric constraint systems. II. A symbolic approach and decision of Rc-constructibility , 1998, Comput. Aided Des..

[8]  G. Sunde,et al.  A CAD System with Declarative Specification of Shape , 1987 .

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

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

[11]  Ivan E. Sutherland,et al.  Sketchpad: a man-machine graphical communication system , 1899, AFIPS '63 (Spring).

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

[13]  R. Light,et al.  Modification of geometric models through variational geometry , 1982 .

[14]  Glenn A. Kramer,et al.  A Geometric Constraint Engine , 1992, Artif. Intell..

[15]  Kwangsoo Kim,et al.  A 2-D geometric constraint solver using DOF-based graph reduction , 1998, Comput. Aided Des..

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

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

[18]  Allan Heydon,et al.  The Juno-2 Constraint-Based Drawing Editor , 1994 .

[19]  Alan Borning,et al.  The Programming Language Aspects of ThingLab, a Constraint-Oriented Simulation Laboratory , 1981, TOPL.

[20]  Christoph M. Hoffmann,et al.  Correctness proof of a geometric constraint solver , 1996, Int. J. Comput. Geom. Appl..

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

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