Research on Algorithm of Geometric Constraint Solving in Declaring Family of Object Modeling

摘要

A new solving approach for constraint problem was proposed in this paper, the constraint problem needed to solve was decomposed not into single sub-problems, but into three types of sub-problems, namely, rigid subset, scalable subset and radial subset, and each type of subset corresponds a cluster of constraint problem. Based on cluster rewriting rule approach, a small set of rewriting rules were applied in constraint system, and then an incremental algorithm was applied, the generic solution will be get when there is no available rewriting rule to be applied. By this approach, we can determine that constraint system is well constrained, under-constrained or over-constrained. The results reveal that the proposed method can efficiently process constraint problem.