对象族特征模型几何约束求解研究  

Research on Geometric Constraint Solving in Family of Objects Feature Model

作　　者：刘宪国[1,2] 孙立镌[1] 

机构地区：[1]哈尔滨理工大学计算机科学与技术学院,哈尔滨150080 [2]辽宁工程技术大学软件学院,葫芦岛125105

出　　处：《计算机科学》2012年第4期269-274,共6页Computer Science

基　　金：国家自然科学基金(60173055)资助

摘　　要：提出一种求解对象族模型的新的几何求解方法。提出两种新类型的组,即可伸缩组和可放射组。在刚性组或非刚性组系统中穷举地使用重写规则的较小的集合,一直到没有可用的重写规则为止,最后的组的集合就表示系统的求解策略。提出并实现一种增量算法,以及在这种新的求解方法中的解选择方法,这些方法都可以高效地找到问题的解,并减少解的个数。A novel method of solving geometric constraints of family of object models was imposed,and two new type clusters were presented,namely scalable subset and radial subset.Smaller collections of rewriting rule were used exhaustively,and were applied in rigid or non-rigid cluster systems,until there is no available rewrite rules so far,and the final cluster collections represent solution strategy of constraint system.A incremental algorithm and solution selection strategy in the solving method were imposed and implemented.Solutions of constraint problem are found efficiently in this method,and the number of solutions will be reduced.

关 键 词：对象族 几何约束 求解规则 增量算法 解选择策略 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]