检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]华中科技大学国家CAD支撑软件工程技术研究中心,湖北武汉430074 [2]武汉交通职业学院机电工程系,湖北武汉430065
出 处:《计算机集成制造系统》2011年第4期680-687,共8页Computer Integrated Manufacturing Systems
基 金:国家自然科学基金资助项目(50875092;50935004);国家863计划资助项目(2007AA04Z136)~~
摘 要:为了重用三维CAD模型中包含的设计知识,提出一种用拉格朗日乘子法求解属性邻接图匹配的三维CAD模型搜索方法。首先应用三维CAD模型中的边界表示信息,将搜索目标三维CAD模型与待搜索三维CAD模型转化为属性邻接图;然后计算搜索目标三维CAD模型与待搜索三维CAD模型属性邻接图之间的顶点和边的相似程度矩阵,并利用它建立两个三维CAD模型相似程度的度量作为选择不同顶点匹配矩阵M的优化目标函数;将目标函数松弛为等式约束后,采用拉格朗日乘子法进行求解。实验结果表明,该方法能够搜索到相似的三维CAD模型,并对模型的相似程度进行排序。To reuse design knowledge in 3D CAD model,a CAD model retrieval method by using Lagrange multiplier method to solve attribute adjacency graph matching was presented.Firstly,3D CAD models for search object and targeted search object were transformed to attribute adjacency graph using boundary representative information in 3D CAD models.Then,the vertex compatibility matrix and edge compatibility matrix between the attribute adjacency graph of the target and searched model were calculated,and the measurement of the two model's similarity was created from the compatibility matrices,which served as the objective function for optimally selecting vertex mapping matrix M between the two models.At last,after relaxing objective function as equality constraints,Lagrange multiplier method was used to solve it.Experimental results showed that this method was able to support the 3D model retrieval and the similarity between the two models was ranked.
关 键 词:拉格朗日乘子法 模型搜索 属性邻接图 计算机辅助设计
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15