面向实体模型相似评价的层次图生成与高效匹配.pdfVIP

第 211给第 7 期 计算机辅助设计与朋形学学报 VoI. 21.No.7 2009 年 7 月 JOURNAL OF COMPUTER-AIDED DESIGN . COMPUTER GRAPHICS July , 2009 面向实体模型相似评价的层次图生成与高效匹配 自静唐书华刘玉生. 高暗明 〈浙江大学 CAD . CG 国家重点实验室杭州 310058) (baíjíng@cad. zju. edu. cn) 摘 要 在二三维模型的表示、匹配与检索中广泛地使用了圈，然而倒匹配的效率十分低下，原因在于它无法有效地 表示阁中不同部分的熏要性及其层次关系.事$子多分辨的描述思想，提出一种层次阁的表征方式，可有般地表征模 型的整体信息、细节信息及它们之间的关系;进一步提出层次阁的匹配算法，通过层次间的关联信息，缩减匹配空 间、优化民配方案.实验结果表明，该匹配算法非常高效，并能够有效地支持实体模型的相似评价. 关键诩 层次图 F 层次回匹配 F 相似评价 z 实体模型 *回法分类唱t TP39 1. 72 Hierarchical Graph Generation and Efficient Matching for Solid Model Similarity Assessment Bai Jing Tang Weihua Liu Yushen旷 Gao Shuming (State key Laboratory of CAD .α; ， Zhej 饵ngUni四rsity. Hang%hou 310058) Abstract Graph is widely used in the representation. matching and retrieval of 3D models. However, ?ts matching efficiency is heavily limited since the common graph cannot represent relative importance of the different parts of the graph nor the relationship between different levels effectively. In this paper. a novel representation of hierarchical graph is proposed. which can represent not only information in different levels but also their relationship. Then. a matching algorithm of hierarchical graph was provided. With making full use of the directive information between different levels, the matching space is reduced dramatically and the matching result is improved effectively. Experimental results show that the hierarchical graph-matching algoríthm is very efficient and suitable for solid model retrieval. Key words hierarchical graph; hierarchical graph-matching; similarity assessment; solid model CAD 技术的广??应用为产品设计提供了丰富 一个难题.实体模型1 相似评价正是解决这一难膛的 的数字资瓣，如设计数据和设计知识，合跚地震用这 关键. 些资源能有效地缩短设计周期、喊少设计风险、提高