摘要
A new algorithm for the solution of under constraint graph in sketch drawing is put forward. 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.
A new algorithm for the solution of under constraint graph in sketch drawing is put forward. 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.
