ACM Home Page
Please provide us with feedback. Feedback
Harmonic 3D shape matching
Full text PdfPdf (54 KB)
Source International Conference on Computer Graphics and Interactive Techniques archive
ACM SIGGRAPH 2002 conference abstracts and applications table of contents
San Antonio, Texas
SESSION: Sketches and applications table of contents
Pages: 191 - 191  
Year of Publication: 2002
ISBN:1-58113-525-4
Authors
Michael Kazhdan  Princeton University
Thomas Funkhouser  Princeton University
Sponsor
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 31,   Citation Count: 3
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1242073.1242204
What is a DOI?

ABSTRACT

With the advent of the world wide web, the number of available 3D models has increased substantially and the challenge has changed from "How do we generate 3D models?" to "How do we find them?" In this sketch we describe a new 3D model matching and indexing algorithm that uses spherical harmonics to compute discriminating similarity measures without requiring repair of model degeneracies or alignment of orientations. It provides 46-245% better performance than related shape matching methods during precision-recall experiments, and it is fast enough to return query results from a repository of 20,000 models in under half a second.



Collaborative Colleagues:
Michael Kazhdan: colleagues
Thomas Funkhouser: colleagues