| 本文已被：浏览 5112次 下载 7227次 |
码上扫一扫！ |
|
|
| 参数化模型欠、过和完整约束的判定算法 |
|
蒋鲲1,2, 高小山2, 岳晶岩2,3
|
|
1.黑龙江大学,理学院,黑龙江,哈尔滨,150080;2.中国科学院,数学机械化重点实验室,北京,100080;3.吉林大学,数学所,吉林,长春,130012
|
|
| 摘要: |
| 在参数化CAD设计中,设计者常常遇到判断一个参数化模型是欠、过和完整约束的问题.针对这个问题,提出了一个判断参数化模型的欠、过和完整约束性的图论算法.该算法不仅能够给出判断,同时还能够对欠和过约束的情形进行定位,即能够给出欠和过约束发生的具体位置.这给设计者在设计过程中提供了很大的方便. |
| 关键词: 参数化CAD 几何约束求解 偶图 DM分解 最大匹配 |
| DOI： |
| 分类号: |
| 基金项目:Supported by the National Grand Fundamental Research 973 Program of China under Grant No.G1998030600 (国家重点基础研究发展规划(973)); the Youth Foundation of Tianyuan Mathematics of China under Grant No.10226006 (数学天元青年基金); the President Foundation of the Chinese Aca |
|
| A Decision Method for Under-,Over-and Well-Constrainess of Parametric Model |
|
JIANG Kun,GAO Xiao-Shan,YUE Jing-Yan
|
| Abstract: |
| 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. |
| Key words: parametric CAD geometric constraint solving bigraph DM-decomposition maximum match |
