An expanding algorithm of geometric constraint solving in semantic feature modeling

A new solving approach for constraint problem was proposed in this study, 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 an incremental algorithm was presented, the solving approach could get the generic solution when no available rewriting rule was available. By this approach, we can determine that constraint system is we 11-constrained, under-constrained or over-constrained. The results reveal that the proposed method can efficiently process constraint problem. © 2011 Asian Network for Scientific Information.