Hierarchical Graph Generation and Efficient Matching for Solid Model Similarity Assessment

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.