摘要
在参数化CAD设计中,设计者常常遇到判断一个参数化模型是欠、过和完整约束的问题.针对这个问题,提出了一个判断参数化模型的欠、过和完整约束性的图论算法.该算法不仅能够给出判断,同时还能够对欠和过约束的情形进行定位,即能够给出欠和过约束发生的具体位置.这给设计者在设计过程中提供了很大的方便.
In parametric CAD design, the designers often encounter the question of judging whether a parametric model is under-, over- or well-constrained. In this paper, a graph-based algorithm for the question is proposed. This algorithm gives not only the decision of under-, over- or well-constrainess of a parametric model, but also the exact location where under-, over- or well-constraint occurs in the parametric model. This feature provides a more convenient way to the designers in the process of designing.
出处
《软件学报》
EI
CSCD
北大核心
2003年第12期2092-2097,共6页
Journal of Software
基金
国家重点基础研究发展规划(973)
数学天元青年基金
中国科学院院长基金~~
关键词
参数化CAD
几何约束求解
偶图
DM分解
最大匹配
parametric CAD
geometric constraint solving
bigraph
DM-decomposition
maximum match