零件尺寸可能的标注模式千变万化，为获得最优的标注模式，将装配体中的每一个要素看成一个顶点，建立装配体全部尺寸的联系路径图。以功能尺寸形成路径最短为出发点，按照功能尺寸精度排序，对尺寸联系路径图进行多条最短路径的求解，最终获得一棵装配尺寸的最短路径生成树。根据标注习惯对最短路径生成树进行修正，可以确定零件最优的自动标注模式，并建立装配体全相关尺寸模型。该方法易于计算机辅助实现，并且适用于复杂装配体中零件尺寸自动标注和尺寸模型的建立。
The possible dimensioning modes of a part are ever-changing, in order to obtain the optimal dimensioning mode, the contact path graph of assembly dimension can be established by taking each surface in an assembly as a node. By taking the formative path of functional dimension as the starting point, ranking the precision of the functional dimension, and solving the multiple shortest path of functional dimension on the basis of the contact path graph, the shortest spanning tree of assembly dimension is obtained. According to the dimension custom, the revised spanning tree can be obtained by revising the shortest spanning tree, which can determine the optimal dimensioning mode of each part and can establish a full interrelated dimension model. This approach can realize by computer aided easily and is more suitable for automatic dimensioning and establishment of dimension model of parts in complex assembly.
[1] 刘嘉敏,潘英俊,张根保,等. OFRG模型中功能尺寸和非功能尺寸的设计[J]. 机械,2002,27(5):4-6. LIU Jiamin,PAN Yingjun,ZHANG Genbao,et al. Design of functional dimension and non-functional dimension in OFRG model[J]. Machinery,2002,27(4):4-6.
[2] CHEN Kezhang,FENG Xinan,LU Quansheng. Intelligent dimensioning for mechanical parts based on feature extraction[J]. Computer-Aided Design,2001,33(13):949-965.
[3] CHEN Kezhang,FENG Xinan,LU Quansheng. Intelligent location-dimensioning of cylindrical surfaces in mechanical parts[J]. Computer-Aided Design,2002,34:185-194.
[4] MARTINEZ M,FELEZ J. A constraint solver to define correctly dimensioned and overdimensioned parts[J]. Computer-Aided Design,2005,37(3):1353-1369.
[5] 陆国栋,黄长林,彭群生.基于分治思想的尺寸自动标注方法的研究与实现[J].计算机辅助设计与图形学报,2001,13(6):521-526. LU Guodong, HUANG Changlin, PENG Qunsheng. Research on automatic dimensioning based on divide and conquer strategy[J]. Journal of Computer Aided Design & Computer Graphics,2001,13(6):521-526.
[6] 陆国栋,雷建兰,彭群生. 面向工程图样智能理解的关系模型[J]. 计算机集成制造系统,2001,7(9):64-68. LU Guodong,LEI Jianlan,PENG Qunsheng. Relation model oriented to intelligent comprehension of engineering drawings[J]. Computer Integrated Manufacturing Systems,2001,7(9):64-68.
[7] 王晓慧,任守华,易金玲. 装配尺寸路径图的建立与应用[J]. 机械工程学报,2012,48(15):131-136. WANG Xiaohui, REN Shouhua, YI Jinling. Schematics of assembly dimension route and its application[J]. Journal of Mechanical Engineering,2012,48(15):131-136.
[8] 王恒,宁汝新,唐承统.三维装配尺寸链的自动生成[J].机械工程学报,2005,41(6):181-187. WANG Heng,NING Ruxin,TANG Chengtong. Automatic generation of 3D assembly dimension chains[J]. Chinese Journal of Mechanical Engineering,2005,41(6):181-187.
[9] 王晓慧.装配尺寸式的研究[J]. 工程设计学报,2008(3):170-174. WANG Xiaohui. Study of assembly dimension formula[J]. Journal of Engineering Design,2008(3):170-174.
[10] 郭崇颖,刘检华,唐承统,等.基于图论的装配尺寸链自动生成技术[J]. 计算机集成制造系统,2014,20(12):2980-2990. GUO Chongying,LIU Jianhua,TANG Chengtong,et al. Automatic generation technology of assembly dimension chain based on graph theory[J].Computer Integrated Manufacturing Systems,2014,20(12):2980-2990.
[11] 周江奇,陈关龙,来新民,等. 车身装配尺寸链生成方法[J]. 机械工程学报,2005,41(7):164-168. ZHOU Jiangqi,CHEN Guanlong,LAI Ximin,et al. Generation of method of automobile body assembly dimension chain[J]. Chinese Journal of Mechanical Engineering,2005,41(7):164-168.
[12] DIJKSTRA E. A note on two problems in connection with graphs[J]. Numerical Mathematics,1959,1:269-271.
[13] BELLMAN R. On a routing problem[J].Quarterly Appl. Math.,1958(16):87-90.
[14] 王雪梅,王义和. 模拟退火算法与遗传算法的结合[J].计算机学报,1997,20(4):381-384. WANG Xuemei,WANG Yihe. The combination of simulated annealing and genetic algorithms[J]. Chinese Journal of Computers,1997,20(4):381-384.
[15] 柴登峰,张登荣. 前N条最短路径问题的算法及应用[J]. 浙江大学学报,2002,36(5):531-534. CHAI Dengfeng,ZHANG Dengrong. Algorithm and its application to N shortest paths problem[J]. Journal of Zhejiang University,2002,36(5):531-534.
[16] 赵礼峰,于汶雨. 一种求解K最短路径问题的新算法[J].计算机技术与发展,2015,25(11):67-70. ZHAO Lifeng,YU Wenyu. A new algorithm for solving K shortest path problem[J]. Computer Technology and Development,2015,25(11):67-70.
