Graph is widely used in the representation, matching and retrieval of 3D models. However, its 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 algorithm is very efficient and suitable for solid model retrieval.%在三维模型的表示、匹配与检索中广泛地使用了图,然而图匹配的效率十分低下,原因在于它无法有效地表示图中不同部分的重要性及其层次关系.基于多分辨的描述思想,提出一种层次图的表征方式,可有效地表征模型的整体信息、细节信息及它们之间的关系;进一步提出层次图的匹配算法,通过层次间的关联信息,缩减匹配空间、优化匹配方案.实验结果表明,该匹配算法非常高效,并能够有效地支持实体模型的相似评价.
展开▼
