| 基于有向图的二维约束求解算法研究 |
| |
| 引用本文： | 王世平,郭连水. 基于有向图的二维约束求解算法研究[J]. 工程图学学报, 2010, 31(1) |
| |
| 作者姓名： | 王世平 郭连水 |
| |
| 作者单位： | 北京航空航天大学机械工程及自动化学院,北京,100191 |
| |
| 摘 要： | 针对过约束、几何完全定义状态判定和约束求解效率等问题,提出了基于约束图,利用自由度理论和约束冲突机制,通过反向约束方向平衡约束,进而通过排序进行约束求解的算法。算法采用约束图记录约束和几何的关系;通过约束平衡的方法进行过约束和几何完全定义的判定;采用排序求解方法,将庞大计算问题转化为一组相对简单的计算问题。算法已得到初步应用,对过约束和几何完全定义状态的判定有明显的效果,而且提高了约束求解效率。
|
| 关 键 词： | 计算机应用 几何约束求解 约束图 过约束 完全定义 排序求解 |
2D Geometric Constraint Solving with Directed Graph |
| |
| WANG Shi-ping,GUO Lian-shui. 2D Geometric Constraint Solving with Directed Graph[J]. Journal of Engineering Graphics, 2010, 31(1) |
| |
| Authors: | WANG Shi-ping GUO Lian-shui |
| |
| Affiliation: | School of Mechanical Engineering and Automation;Beijing University of Aeronautics and Astronautics;Beijing 100191;China |
| |
| Abstract: | In order to solve the over-constrained problem and enhance computational efficiency, an algorithm, which is based on the constructing directed constraint graph, revealing constraint conflict, then reversing the direction of the related constraint to balance the constraint graph, and finally sorting the graph to get the solving sequence of geometric entities, is presented. The method of balancing constraints can help transforming the over-constrained problem into well-constrained. |
| |
| Keywords: | computer application solution of geometric constraint constraint graph over-constrained well-constrained sort algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
