Fast Approximation of Laplace-Beltrami Eigenproblems

dc.contributor.authorNasikun, Ahmaden_US
dc.contributor.authorBrandt, Christopheren_US
dc.contributor.authorHildebrandt, Klausen_US
dc.contributor.editorJu, Tao and Vaxman, Amiren_US
dc.date.accessioned2018-07-27T12:54:42Z
dc.date.available2018-07-27T12:54:42Z
dc.date.issued2018
dc.description.abstractThe spectrum and eigenfunctions of the Laplace-Beltrami operator are at the heart of effective schemes for a variety of problems in geometry processing. A burden attached to these spectral methods is that they need to numerically solve a large-scale eigenvalue problem, which results in costly precomputation. In this paper, we address this problem by proposing a fast approximation algorithm for the lowest part of the spectrum of the Laplace-Beltrami operator. Our experiments indicate that the resulting spectra well-approximate reference spectra, which are computed with state-of-the-art eigensolvers. Moreover, we demonstrate that for different applications that comparable results are produced with the approximate and the reference spectra and eigenfunctions. The benefits of the proposed algorithm are that the cost for computing the approximate spectra is just a fraction of the cost required for numerically solving the eigenvalue problems, the storage requirements are reduced and evaluation times are lower. Our approach can help to substantially reduce the computational burden attached to spectral methods for geometry processing.en_US
dc.description.number5
dc.description.sectionheadersDiscrete Differential Geometry
dc.description.seriesinformationComputer Graphics Forum
dc.description.volume37
dc.identifier.doi10.1111/cgf.13496
dc.identifier.issn1467-8659
dc.identifier.pages121-134
dc.identifier.urihttps://doi.org/10.1111/cgf.13496
dc.identifier.urihttps://diglib.eg.org:443/handle/10.1111/cgf13496
dc.publisherThe Eurographics Association and John Wiley & Sons Ltd.en_US
dc.titleFast Approximation of Laplace-Beltrami Eigenproblemsen_US
Files
Collections