| 几何约束求解的简化迭代算法 |
| |
| 引用本文： | 石志良,陈立平.几何约束求解的简化迭代算法[J].计算机辅助设计与图形学学报,2006,18(6):787-792. |
| |
| 作者姓名： | 石志良 陈立平 |
| |
| 作者单位： | 华中科技大学国家CAD支撑软件工程技术研究中心,武汉,430074 |
| |
| 基金项目： | 国家重点基础研究发展计划(973计划);中国科学院资助项目 |
| |
| 摘 要： | 针对几何约束系统图分解中复合顶点的求解问题,提出复合顶点的图分解算法和等价自由变量的简化迭代求解算法.通过去除复合顶点部分边界约束对复合顶点进行图分解,对求解序列中的欠约束顶点添加等价自由变量、以等价自由变量的部分迭代求解、替代系统的整体数值求解,以提高求解效率和稳定性.该算法具有很强的通用性,并在实际应用中得到验证.
|
| 关 键 词： | 几何推理 几何约束 几何约束求解 图分解 等价自由变量 |
| 收稿时间： | 2005-04-30 |
| 修稿时间： | 2005-08-26 |
A Simplified Iterative Algorithm to Solve Geometric Constraints |
| |
| Shi Zhiliang,Chen Liping.A Simplified Iterative Algorithm to Solve Geometric Constraints[J].Journal of Computer-Aided Design & Computer Graphics,2006,18(6):787-792. |
| |
| Authors: | Shi Zhiliang Chen Liping |
| |
| Affiliation: | National CAD Support Software Engineering Research Center, Huazhong University of Science and Technology, Wuhan 430074 |
| |
| Abstract: | To improve efficiency and generality of solving non-constructible geometric constraints, a decomposing approach and a novel simplified iterative algorithm are presented. The proposed approaches work in two phases: a decomposing phase and a solving phase. The decomposing approach is based on graph theory to decompose the strongly connected components by cancelling some boundary constraints, while for underconstrained vertices, equivalence free variables are added. In solving phase, rather than undertaking simultaneously iteration of all variables, geometric constraints solving is accomplished by partial iteration of equivalence free variables alone. The presented method is effective and general, and has been successfully applied to a 2D parametric system. |
| |
| Keywords: | geometric reasoning geometric constraint geometric constraints solving graph decomposition equivalence free variable |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
