| 一种欠约束几何系统求解的图优化方法 |
| |
| 引用本文： | 陈立平,王波兴,彭晓波,周济.一种欠约束几何系统求解的图优化方法[J].华中科技大学学报(自然科学版),2000,28(6):104-107. |
| |
| 作者姓名： | 陈立平 王波兴 彭晓波 周济 |
| |
| 作者单位： | 华中理工大学CAD中心 |
| |
| 基金项目： | 国家高技术研究发展计划资助项目(9842-003) |
| |
| 摘 要： | 针对一般几何约束系统欠约束状态下约束分解的多态性，对相应的有向图强连通子图提出了进一步分解的二部图匹配自适应优化处理策略，给出了主要算法，实现了欠约束系统的优化分解，有利于一般几何约束系统快速求解．
|
| 关 键 词： | 几何约束 二部图匹配 几何约束满足 参数化设计 |
| 文章编号： | 1000-8616(2000)06-0104-04 |
| 修稿时间： | 1999年7月6日 |
A Graph Optimal Method for Under-Constrained Geometry Solving |
| |
| Chen Liping,Wang Boxing,Peng Xiaobo,Zhou Ji.A Graph Optimal Method for Under-Constrained Geometry Solving[J].JOURNAL OF HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY.NATURE SCIENCE,2000,28(6):104-107. |
| |
| Authors: | Chen Liping Wang Boxing Peng Xiaobo Zhou Ji |
| |
| Abstract: | A set of algorithms is presented in this paper, which deals with constraint decomposition of under constrained geometry. In these algorithms, an optimal processing method of bipartite graph matching is proposed which has advantages of further decomposition of the relative strong component of direct graph. The optimal decomposition is realized in the general under constrained geometry solving. It is good for fast solving of the general geometry constraint system. |
| |
| Keywords: | geometrical constrain bipartite graph matching parametric design constaint satisfaction |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
