The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Laplace-Beltrami Eigenfunctions Towards an Algorithm That "Understands" Geometry
Open accessAbstract
One of the challenges in geometry processing is to automatically reconstruct a higher-level representation from raw geometric data. For instance, computing a parameterization of an object helps attaching information to it and converting between various representations. More generally, this family of problems may be thought of in terms of constructing structured function bases attached to surfaces. In this paper, we study a specific type of hierarchical function bases, defined by the eigenfunctions of the Laplace-Beltrami operator. When applied to a sphere, this function basis corresponds to the classical spherical harmonics. On more general objects, this defines a function basis well adapted to the geometry and the topology of the object. Based on physical analogies (vibration modes), we first give an intuitive view before explaining the underlying theory. We then explain in practice how to compute an approximation of the eigenfunctions of a differential operator, and show possible applications in geometry processing
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Nonlinear Dimensionality Reduction by Locally Linear Embedding
Roweis, S. T., & Saul, L. K. (2000) · Science · doi:10.1126/science.290.5500.2323 · Cited by 14,965
A Global Geometric Framework for Nonlinear Dimensionality Reduction
Tenenbaum, J. B., Silva, V. D., & Langford, J. C. (2000) · Science · doi:10.1126/science.290.5500.2319 · Cited by 13,585
Algebraic connectivity of graphs
Fiedler, M. (1973) · Czechoslovak Mathematical Journal · doi:10.21136/cmj.1973.101168 · Cited by 3,977
A signal processing approach to fair surface design
Taubin, G. (1995) · Proceedings of the 22nd annual conference on Computer graphics and interactive techniques - SIGGRAPH '95 · doi:10.1145/218380.218473 · Cited by 1,855
Can One Hear the Shape of a Drum?
Kac, M. (1966) · The American Mathematical Monthly · doi:10.1080/00029890.1966.11970915 · Cited by 1,696
Computing Discrete Minimal Surfaces and Their Conjugates
Pinkall, U., & Polthier, K. (1993) · Experimental Mathematics · doi:10.1080/10586458.1993.10504266 · Cited by 1,249
A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory
Fiedler, M. (1975) · Czechoslovak Mathematical Journal · doi:10.21136/cmj.1975.101357 · Cited by 1,042
Least squares conformal maps for automatic texture atlas generation
Lévy, B., Petitjean, S., Ray, N., & Maillot, J. (2002) · Proceedings of the 29th annual conference on Computer graphics and interactive techniques · doi:10.1145/566570.566590 · Cited by 943
Surface Parameterization: a Tutorial and Survey
Floater, M. S., & Hormann, K. (2005) · Mathematics and Visualization · doi:10.1007/3-540-26808-1_9 · Cited by 874
Laplace–Beltrami spectra as ‘Shape-DNA’ of surfaces and solids
Reuter, M., Wolter, F.-E., & Peinecke, N. (2006) · Computer-Aided Design · doi:10.1016/j.cad.2005.10.011 · Cited by 779
Spectral compression of mesh geometry
Karni, Z., & Gotsman, C. (2000) · Proceedings of the 27th annual conference on Computer graphics and interactive techniques - SIGGRAPH '00 · doi:10.1145/344779.344924 · Cited by 652
MAPS: multiresolution adaptive parameterization of surfaces
Lee, A. W. F., Sweldens, W., Schröder, P., Cowsar, L., & Dobkin, D. (1998) · Proceedings of the 25th annual conference on Computer graphics and interactive techniques - SIGGRAPH '98 · doi:10.1145/280814.280828 · Cited by 626
Fundamentals of spherical parameterization for 3D meshes
Gotsman, C., Gu, X., & Sheffer, A. (2003) · ACM SIGGRAPH 2003 Papers · doi:10.1145/1201775.882276 · Cited by 267
Texture mapping using surface flattening via multidimensional scaling
Zigelman, G., Kimmel, R., & Kiryati, N. (2002) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/2945.998671 · Cited by 259
CHARMS: a simple framework for adaptive simulation
Grinspun, E., Krysl, P., & Schröder, P. (2002) · Proceedings of the 29th annual conference on Computer graphics and interactive techniques · doi:10.1145/566570.566578 · Cited by 259
A frequency analysis of light transport
Durand, F., Holzschuch, N., Soler, C., Chan, E., & Sillion, F. X. (2005) · ACM Transactions on Graphics · doi:10.1145/1073204.1073320 · Cited by 222
Iso-charts: stretch-driven mesh parameterization using spectral analysis
Zhou, K., Synder, J., Guo, B., & Shum, H.-Y. (2004) · Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing · doi:10.1145/1057432.1057439 · Cited by 177
Koren, Y. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-45071-8_50 · Cited by 159
Isenburg, M., & Lindström, P. (2005) · Cited by 148
Computing Betti Numbers via Combinatorial Laplacians
Friedman, J. (1998) · Algorithmica · doi:10.1007/pl00009218 · Cited by 102
Computing Betti numbers via combinatorial Laplacians
Friedman, J. (1996) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/237814.237985 · Cited by 45
On graph partitioning, spectral analysis, and digital mesh processing
Gotsman, C. (2003) · IEEE International Conference on Shape Modeling and Applications · doi:10.1109/smi.2003.1199613 · Cited by 38
Quadrangulating a Mesh using Laplacian Eigenvectors
Dong, S., Bremer, P., Garland, M., et al. (2005) · Cited by 25
Cited by
The wave kernel signature: A quantum mechanical approach to shape analysis
Aubry, M., Schlickewei, U., & Cremers, D. (2011) · 2011 IEEE International Conference on Computer Vision Workshops (ICCV Workshops) · doi:10.1109/iccvw.2011.6130444 · Cited by 731
Geodesic Convolutional Neural Networks on Riemannian Manifolds
Masci, J., Boscaini, D., Bronstein, M. M., & Vandergheynst, P. (2015) · 2015 IEEE International Conference on Computer Vision Workshop (ICCVW) · doi:10.1109/iccvw.2015.112 · Cited by 721
Scale-invariant heat kernel signatures for non-rigid shape recognition
Bronstein, M. M., & Kokkinos, I. (2010) · 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2010.5539838 · Cited by 686
Spectral Geometry Processing with Manifold Harmonics
Vallet, B., & Lévy, B. (2008) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2008.01122.x · Cited by 386
Bronstein, A. M., Bronstein, M. M., Kimmel, R., Mahmoudi, M., & Sapiro, G. (2010) · International Journal of Computer Vision · doi:10.1007/s11263-009-0301-6 · Cited by 267
Metadata
- Authors
- Levy, B.
- Venue
- IEEE International Conference on Shape Modeling and Applications 2006 (SMI'06)
- Publisher
- IEEE
- Published
- 2006-07-10
- Pages
- 13-13
- OpenAlex
- W1984159596
- Cited by
- 422
- References
- 23
- FWCI
- 26.74
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.