| 2 | A new Algorithm for the Solution of under Constraint Graph in Sketch Drawing显示文摘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. | Dong Yude①② Zhao Han② Tang Jianrong③ ① Department of Computer, University of Science and Technology of China, Hefei 230052, China ② Hefei University of Technology, Hefei 230009, China ③State Key Lab. of CAD&CG, ZheJiang University, Hangzhou | 2001 | Computer Aided Drafting,Design and Manufacturing2001，11，1： | 2 |
您所在的机构暂未开通此部分的功能，请联系管理员