A New Incremental Decomposition Technique for 2D and 3D Geometric Constraint Systems ⋆

Geometric Constraint Solving (GCS) is the core of modern intelligent and parametric Computer-aided Design (CAD) and Computer-aided Manufacturing (CAM). Meanwhile, GCS are also pervasively used in many other important application domains. How to increase parametric design efficiency and enhance robustness of system solution to satisfy design requirements are important research issues in numerous GCS techniques. Meanwhile, the graph constructive approach is widely used in recent CAD systems. In this paper, we propose an incremental decomposition technique for 2D and 3D geometric constraint systems. By using Latham-Middleditch’s algorithm [1] in the smallest influence domain the technique implements maximized decomposition of constraint system, is a general decomposition method. Theories and experiments indicate that the technique expands the decomposable ranges of constraint system and improves decomposition efficiency on the premise of ensuring robustness