Spectral Geometry Processing with Manifold Harmonics
| dc.contributor.author | Vallet, B. | en_US |
| dc.contributor.author | Levy, B. | en_US |
| dc.date.accessioned | 2015-02-21T16:18:39Z | |
| dc.date.available | 2015-02-21T16:18:39Z | |
| dc.date.issued | 2008 | en_US |
| dc.description.abstract | We present an explicit method to compute a generalization of the Fourier Transform on a mesh. It is well known that the eigenfunctions of the Laplace Beltrami operator (Manifold Harmonics) define a function basis allowing for such a transform. However, computing even just a few eigenvectors is out of reach for meshes with more than a few thousand vertices, and storing these eigenvectors is prohibitive for large meshes. To overcome these limitations, we propose a band-by-band spectrum computation algorithm and an out-of-core implementation that can compute thousands of eigenvectors for meshes with up to a million vertices. We also propose a limited-memory filtering algorithm, that does not need to store the eigenvectors. Using this latter algorithm, specific frequency bands can be filtered, without needing to compute the entire spectrum. Finally, we demonstrate some applications of our method to interactive convolution geometry filtering. These technical achievements are supported by a solid yet simple theoretic framework based on Discrete Exterior Calculus (DEC). In particular, the issues of symmetry and discretization of the operator are considered with great care. | en_US |
| dc.description.number | 2 | en_US |
| dc.description.seriesinformation | Computer Graphics Forum | en_US |
| dc.description.volume | 27 | en_US |
| dc.identifier.doi | 10.1111/j.1467-8659.2008.01122.x | en_US |
| dc.identifier.issn | 1467-8659 | en_US |
| dc.identifier.pages | 251-260 | en_US |
| dc.identifier.uri | https://doi.org/10.1111/j.1467-8659.2008.01122.x | en_US |
| dc.publisher | The Eurographics Association and Blackwell Publishing Ltd | en_US |
| dc.title | Spectral Geometry Processing with Manifold Harmonics | en_US |