Topology matching for fully automatic similarity estimation of 3D shapes
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
ACM Transactions on Graphics (TOG)
Scale-space representation of 3D models and topological matching
SM '03 Proceedings of the eighth ACM symposium on Solid modeling and applications
Recognizing Objects by Matching Oriented Points
CVPR '97 Proceedings of the 1997 Conference on Computer Vision and Pattern Recognition (CVPR '97)
Matching 3D Models with Shape Distributions
SMI '01 Proceedings of the International Conference on Shape Modeling & Applications
A Survey of Content Based 3D Shape Retrieval Methods
SMI '04 Proceedings of the Shape Modeling International 2004
3D Object Retrieval using Many-to-many Matching of Curve Skeletons
SMI '05 Proceedings of the International Conference on Shape Modeling and Applications 2005
Pose-Oblivious Shape Signature
IEEE Transactions on Visualization and Computer Graphics
A benchmark for 3D mesh segmentation
ACM SIGGRAPH 2009 papers
3D Mesh decomposition using Reeb graphs
Image and Vision Computing
Three-dimensional shape searching: state-of-the-art review and future trends
Computer-Aided Design
Object recognition through topo-geometric shape models using error-tolerant subgraph isomorphisms
IEEE Transactions on Image Processing
From exact to approximate maximum common subgraph
GbRPR'05 Proceedings of the 5th IAPR international conference on Graph-Based Representations in Pattern Recognition
| Hi-index | 0.00 |
In this paper, we present an algorithm for partial shape retrieval on a collection of 3D polygonal meshes. The proposed algorithm is invariant against rigid transformations and robust against nonrigid transformations. By using structure properties and geometric properties to represent shapes. Structure property is represented by a Reeb graph which uses an integral geodesic distance as a Morse function, whereas geometric property is represented by a Pose invariant Shape Signature. The main idea is to use Reeb graph for decomposing shape into many meaningful sub parts. Then describing each sub part by the Pose-invariant Shape Signature. The similarity is computed based on the Approximate Maximum Common Subgraph [Marini et al. 2005; Biasotti et al. 2006] for matching each sub-part between query shape and other while preserving topology. We evaluate our algorithm on various different model classes and deformation.