Accurate computation of the medial axis of a polyhedron
Proceedings of the fifth ACM symposium on Solid modeling and applications
Skeletonization of Three-Dimensional Object Using Generalized Potential Field
IEEE Transactions on Pattern Analysis and Machine Intelligence
Topology matching for fully automatic similarity estimation of 3D shapes
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
An Algorithm for the Medial Axis Transform of 3D Polyhedral Solids
IEEE Transactions on Visualization and Computer Graphics
Triangles as a Primary Representation
Proceedings of the International NSF-ARPA Workshop on Object Representation in Computer Vision
Scale-space representation of 3D models and topological matching
SM '03 Proceedings of the eighth ACM symposium on Solid modeling and applications
Skeleton Extraction of 3D Objects with Radial Basis Functions
SMI '03 Proceedings of the Shape Modeling International 2003
Matching 3D Models with Shape Distributions
SMI '01 Proceedings of the International Conference on Shape Modeling & Applications
A Geometric Approach to 3D Object Comparison
SMI '01 Proceedings of the International Conference on Shape Modeling & Applications
Shock Graphs and Shape Matching
ICCV '98 Proceedings of the Sixth International Conference on Computer Vision
A Survey of Content Based 3D Shape Retrieval Methods
SMI '04 Proceedings of the Shape Modeling International 2004
Augmented Reeb Graphs for Content-Based Retrieval of 3D Mesh Models
SMI '04 Proceedings of the Shape Modeling International 2004
Hi-index | 0.01 |
In this paper, we describe a novel algorithm for searching and comparing 3D models, called the Integer Medial Axis Skeleton (IMAS), in which the geometric and topological information is encoded in the form of an IMAS and uses skeletal binary tree matching techniques to match the skeletons and to compare them. The skeletal binary tree is constructed based on the IMAS that was constructed using a modification of an IMA transforms algorithm. The similarity calculation between 3D models is processed using a coarse-to-fine strategy. A feature of skeletal binary tree matching is the ability to perform part-matching and provide a fast estimation of similarity between models. The performance of the proposed algorithm is compared to some previous approaches by means of precision/recall tests. Generally, results show that the new algorithm introduces improvements in the 3D-model retrieval process.