Submit Manuscript

Information Technology Journal

Year: 2011 | Volume: 10 | Issue: 7 | Page No.: 1447-1451
Facebook Twitter Digg Reddit Linkedin StumbleUpon E-mail

Article Trend

Total views 346

Search

Authors

Xianguo Liu

Lijuan Sun

Keywords

Research Article

An Expanding Algorithm of Geometric Constraint Solving in Semantic Feature Modeling

Xianguo Liu and Lijuan Sun
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 well-constrained, under-constrained or over-constrained. The results reveal that the proposed method can efficiently process constraint problem.
PDF Fulltext XML References Citation

Leave a Comment

Your email address will not be published. Required fields are marked *