Biharmonic distance

ACM Transactions on Graphics

Volumn 29, Issue 3, 2010, Pages

  Lipman, Yaron ^a   Rustamov, Raif M ^b   Funkhouser, Thomas A ^a  

^a PRINCETON UNIVERSITY   (United States)

^b DREW UNIVERSITY   (United States)

Author keywords

Mesh distance; Mesh processing; Shape analysis

Indexed keywords

3D SURFACE; BASIC PROPERTIES; BI-HARMONIC; DIFFERENTIAL OPERATORS; DIFFUSION DISTANCE; DISTANCE MEASURE; EIGENVALUES; EMPIRICAL ANALYSIS; FUNDAMENTAL PROBLEM; GEODESIC DISTANCES; GEOMETRIC PROCESSING; LAPLACE-BELTRAMI OPERATOR; MEASURING DISTANCES; MESH DISTANCE; MESH PROCESSING; SHAPE ANALYSIS; TIME DISTANCE;

EIGENVALUES AND EIGENFUNCTIONS; GEODESY; MATHEMATICAL OPERATORS;

COMPUTER GRAPHICS;

EID: 77956286575     PISSN: 07300301     EISSN: 15577368     Source Type: Journal    
DOI: 10.1145/1805964.1805971     Document Type: Article

References (20)

1. ANGUELOV, D., SRINIVASAN, P., KOLLER, D., THRUN, S., RODGERS, J., AND DAVIS, J. 2005. Scape: Shape completion and animation of people. ACM Trans. Graph. 24, 3, 408-416.
2. BERGER, M. 2003. A Panoramic View of Riemannian Geometry. Springer-Verlag, Berlin.
3. BOTSCH,M.,BOMMES, D., AND KOBBELT, L. 2005. Efficient linear system solvers for mesh processing. In Mathematics of Surfaces XI. Lecture Notes in Computer Science, vol.3604. Springer, 62-83.
4. BRONSTEIN, A. M., BRONSTEIN, M. M., AND KIMMEL, R. 2006. Efficient computation of isometry-invariant distances between surfaces. SIAM J. Sci. Comput. 28, 5, 1812-1836.
5. COIFMAN, R. R. AND LAFON, S. 2006. Diffusion maps. Appl. Comput. Harmonic Anal. 21, 1, 5-30.
6. FOUSS, F., PIROTTE, A., MICHEL RENDERS, J., AND SAERENS, M. 2006. Random-walk computation of similarities between nodes of a graph, with application to collaborative recommendation. IEEE Trans. Know. Data Engin. 19.
7. GIORGI, D., BIASOTTI, S., AND PARABOSCHI, L. 2007. SHREC:SHape REtrieval Contest: Watertight models track. http://watertight.ge.imati.cnr.it/.
8. GOES, F. D., GOLDENSTEIN, S., AND VELHO, L. 2008. A hierarchical segmentation of articulated bodies. Comput. Graph. Forum (Special Issue of Symposium on Geometry Processing) 27, 5, 1349-1356.
9. GORDON, W. J. AND WIXOM, J. A. 1978. Shepard's method of "metric interpolation" to bivariate and multivariate interpolation. Math. Comput. 32, 141, 253-264.
10. GRINSPUN, E., GINGOLD, Y., REISMAN, J., AND ZORIN, D. 2006. Computing discrete shape operators on general meshes. Comput. Graph. Forum 25, 3, 547-556. (Eurographics 2006 Best Paper, 3rd Place).
11. JOHN, F. 1986. Partial Differential Equations. Springer-Verlag.
12. MCKEAN, J. AND SINGER, I. M. 1967. Curvature and the eigenvalues of the laplacian. J. Differential Geom. 1.
13. MéMOLI, F. AND SAPIRO, G. 2005. A theoretical and computational framework for isometry invariant recognition of point cloud data. Found. Comput. Math. 5, 3, 313-347.
14. MEYER, M.,DESBRUN, M., SCHRDER, P., AND BARR, A. H. 2002. Discrete differential-geometry operators for triangulated 2-manifolds. In Visualization and Mathematics III, H.-C. Hege and K. Polthier, Eds. Springer, 35-57.
15. PAPADIMITRIOU, C. 1985. An algorithm for shortest-path motion in three dimensions. Inf. Process. Lett. 20, 259-1163
16. PINKALL, U. AND POLTHIER, K. 1993. Computing discrete minimal surfaces and their conjugates. Exper. Math. 2, 15-36.
17. QIU, H. AND HANCOCK, E. R. 2007. Clustering and embedding using commute times. IEEE Trans. Pattern Anal. Mach. Intell. 29, 11, 1873-1890.
18. SHEPARD, D. 1968. A two-dimensional interpolation function for irregularly-spaced data. In Proceedings of the 23rd ACM National Conference. ACM, New York, 517-524.
19. SURAZHSKY, V., SURAZHSKY, T., KIRSANOV, D., GORTLER, S. J., AND HOPPE, H. 2005. Fast exact and approximate geodesics on meshes. ACM Trans. Graph. 24, 3, 553-560.
20. YEN, L., FOUSS, F., DECAESTECKER, C., FRANCQ, P., AND SAERENS, M. 2007. Graph nodes clustering based on the commute-time kernel. In Proceedings of the 11th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD'07). Lecture Notes in Computer Science.