Approzimate Shape Matching And Symmetry Detection for 3D Shapes With Guaranteed Error Bounds
In this paper, we describe a system for approximate shape matching and symmetry (rotation and reflection) detection of geometric shapes represented as point clouds. Rather than using the leastsquares distance as a measure of similarity between shapes, we use the Hausdorff distance between point sets as the underlying shape metric. This allows us to exploit methods from geometric pattern matching to return symmetries and rigid transformation matches with guaranteed error bounds on the quality of our solution. The approximation is determined by intuitive user-specified input precision and distance threshold parameters. Another important feature of our method is that it leverages FFT-based techniques for string matching to compute all approximate symmetries simultaneously. Our algorithm is simple to implement and is efficient; we present a detailed experimental study.
shape matching symmetry detection pattern matching geometric algorithms
Shankar Krishnan Suresh Venkatasubramanian
180 Park Avenue, AT&T Shannon Laboratory, Florham Park, NJ 07932, USA School of Computing, Univ.of Utah, Salt Lake City, UT 84112, USA
国际会议
IEEE International Conference on Shape Modeling and Applications (SMI)(2009年形状建模国际会议)
北京
英文
44-51
2009-06-26（万方平台首次上网日期，不代表论文的发表时间）