一种几何约束系统分解算法  

Decomposing algorithm for geometric constraint system

作　　者：袁波[1] 李彦涛[1] 胡事民[1] 孙家广[1] 

机构地区：[1]清华大学计算机科学与技术系,北京100084

出　　处：《清华大学学报（自然科学版）》2000年第1期65-67,共3页Journal of Tsinghua University(Science and Technology)

基　　金：国家自然科学基金项目!(6 9772 0 1 9)

摘　　要：为提高变量化设计效率和数值稳定性 ,提出了一种结合剪枝操作和归约操作的几何约束系统分解算法 :剪枝 -归约算法。该算法能够处理完备约束、过约束以及欠约束情况下几何约束系统的分解问题。Decomposition of a geometric constraint system is an effective way to improve computing efficiency and numerical stability in variational design. Two graph decomposing operations, clipping and reducing, were introduced based on the constraint graph. The clipping operation was applied to sparse coupling conditions while the reducing operator was applied to dense coupling conditions. A decomposing algorithm was developed by integrating the two graph operations, and could decompose well , over and under constrained geometric systems. The problem was also discussed of how to find the design intent satisfied decomposition plan in the under constrained design conditions.

关 键 词：变量化设计 几何约束系统 分解 CAD 算法 

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