TY - GEN
T1 - Harmonic 3D shape matching
AU - Kazhdan, Michael
AU - Funkhouser, Thomas
PY - 2002/7/21
Y1 - 2002/7/21
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84945980822&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84945980822&partnerID=8YFLogxK
U2 - 10.1145/1242073.1242204
DO - 10.1145/1242073.1242204
M3 - Conference contribution
AN - SCOPUS:84945980822
T3 - ACM SIGGRAPH 2002 Conference Abstracts and Applications, SIGGRAPH 2002
SP - 191
BT - ACM SIGGRAPH 2002 Conference Abstracts and Applications, SIGGRAPH 2002
PB - Association for Computing Machinery
T2 - International Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 2002
Y2 - 21 July 2002 through 26 July 2002
ER -