Approximating polyhedral objects with deformable smooth surfaces
Computational Geometry: Theory and Applications
Recovering structure from r-sampled objects
SGP '09 Proceedings of the Symposium on Geometry Processing
Approximating polygonal objects by deformable smooth surfaces
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
| Hi-index | 0.00 |
Three dimensional shape matching plays an importantrole in many of todayýs applications. Nevertheless, shapematching is a difficult problem since there is no uniquemeasure that defines shape similarity and since computingshape distance using various measures is an elaborate task.In this paper we present a new framework for matchingshapes, represented by union of spheres hierarchies. Ourapproach is "feature-sensitive" since it extends the usualgeometry-based matching by adding sensitivity to shapetopology, shape features (sharp angles, chemical attributes)and their relative positioning on the shape. Our method canbe used in conjecture with other geometric matching methodsas a pre or post-processing filtering stage, or it can beused as a stand-alone feature-sensitive matching.