一种欠约束草图求解方法的研究

A New Method for the Solution of Under Constraint Graph in Sketch Drawing

基于约束的参数化描述及求解是计算机辅助设计研究的一个热点 ,欠约束图的求解是参数化设计的基本问题 ,为了提高欠约束草图求解的参数化设计效率 ,提出了一种基于隐式约束优先级的欠约束草图求解方法 ,并首先给出了欠约束图求解的一般方法以及欠约束图的基本特征 ,提出了利用隐式约束去匹配缺少的显式约束 ;然后将隐式约束按照一定的规则分成不同的优先级 ,再利用优先级高的隐式约束去匹配变动约束图中的欠约束 ,直到完成约束图的有向化 ;最后 ,探讨了无尺寸约束图有向化过程中的基本特点 ,并给出了无尺寸约束图的求解算法和应用实例。实例应用结果表明 。

Constraint-based parametric description and inferring is one of the host spot in the research of computer-aided design, the solution to under constraint graph is a basic question in parametric design, this paper presents a series of solving methods for sketch drawing based on the priority of under constraint. This article gives general methods for under constraint graph and its basic features firstly, a new method for the solution to under constraint graph in sketch drawing is put forward, in which required apparent constraints are replaced by concealed constraints. The directed process of constraint graph is completed by picking concealed constraints of adjacent entities in sketch of few or no dimensions. In this paper, the priority of concealed constraint is given by the different constraint types and constructing orders, and some more priority concealed constraints are forced into obvious ones by the need number of constraint for every node in constraint solution process.