Spectral Mesh Simplification

The spectrum of the Laplace‐Beltrami operator is instrumental for a number of geometric modeling applications, from processing to analysis. Recently, multiple methods were developed to retrieve an approximation of a shape that preserves its eigenvectors as much as possible, but these techniques output a subset of input points with no connectivity, which limits their potential applications. Furthermore, the obtained Laplacian results from an optimization procedure, implying its storage alongside the selected points. Focusing on keeping a mesh instead of an operator would allow to retrieve the latter using the standard cotangent formulation, enabling easier processing afterwards. Instead, we propose to simplify the input mesh using a spectrum‐preserving mesh decimation scheme, so that the Laplacian computed on the simplified mesh is spectrally close to the one of the input mesh. We illustrate the benefit of our approach for quickly approximating spectral distances and functional maps on low resolution proxies of potentially high resolution input meshes.

[1]  Trevor Campbell,et al.  Coresets for Scalable Bayesian Logistic Regression , 2016, NIPS.

[2]  Dinesh Manocha,et al.  Simplification envelopes , 1996, SIGGRAPH.

[3]  Maks Ovsjanikov,et al.  Functional maps , 2012, ACM Trans. Graph..

[4]  Leonidas J. Guibas,et al.  A concise and provably informative multi-scale signature based on heat diffusion , 2009 .

[5]  Pedro V. Sander,et al.  Silhouette clipping , 2000, SIGGRAPH.

[6]  Sushant Sachdeva,et al.  Approximate Gaussian Elimination for Laplacians - Fast, Sparse, and Simple , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

[7]  Daniel Cremers,et al.  The wave kernel signature: A quantum mechanical approach to shape analysis , 2011, 2011 IEEE International Conference on Computer Vision Workshops (ICCV Workshops).

[8]  Nancy Argüelles,et al.  Author ' s , 2008 .

[9]  Maks Ovsjanikov,et al.  Spectral coarsening of geometric operators , 2019, ACM Trans. Graph..

[10]  Mathieu Desbrun,et al.  Material-adapted refinable basis functions for elasticity simulation , 2019, ACM Trans. Graph..

[11]  Dingzeyu Li,et al.  Interactive Acoustic Transfer Approximation for Modal Sound , 2015, ACM Trans. Graph..

[12]  Alec Jacobson,et al.  Nested cages , 2015, ACM Trans. Graph..

[13]  Pierre Vandergheynst,et al.  Spectrally approximating large graphs with smaller graphs , 2018, ICML.

[14]  Houman Owhadi,et al.  Operator-Adapted Wavelets, Fast Solvers, and Numerical Homogenization , 2019 .

[15]  Pierre Alliez,et al.  Variational shape approximation , 2004, ACM Trans. Graph..

[16]  Andreas Loukas,et al.  Graph Reduction with Spectral and Cut Guarantees , 2018, J. Mach. Learn. Res..

[17]  Michael Garland,et al.  Surface simplification using quadric error metrics , 1997, SIGGRAPH.

[18]  E LorensenWilliam,et al.  Decimation of triangle meshes , 1992 .

[19]  Jing Ren,et al.  Continuous and orientation-preserving correspondences via functional maps , 2018, ACM Trans. Graph..

[20]  William E. Lorensen,et al.  Decimation of triangle meshes , 1992, SIGGRAPH.

[21]  Alec Jacobson,et al.  Seamless: seam erasure and seam-aware decoupling of shape from mesh resolution , 2017, ACM Trans. Graph..

[22]  Daniel Cremers,et al.  Efficient Deformable Shape Correspondence via Kernel Matching , 2017, 2017 International Conference on 3D Vision (3DV).

[23]  Michael Garland,et al.  Permission grids: practical, error-bounded simplification , 2002, TOGS.

[24]  Alexander M. Bronstein,et al.  Deep Functional Maps: Structured Prediction for Dense Shape Correspondence , 2017, 2017 IEEE International Conference on Computer Vision (ICCV).

[25]  Olga Sorkine-Hornung,et al.  Instant field-aligned meshes , 2015, ACM Trans. Graph..

[26]  Jovan Popovic,et al.  Progressive simplicial complexes , 1997, SIGGRAPH.

[27]  Michael Garland,et al.  Simplifying surfaces with color and texture using quadric error metrics , 1998, IEEE Visualization.

[28]  Hugues Hoppe,et al.  New quadric metric for simplifying meshes with appearance attributes , 1999, Proceedings Visualization '99 (Cat. No.99CB37067).

[29]  Eitan Grinspun,et al.  Discrete laplace operators: no free lunch , 2007, Symposium on Geometry Processing.

[30]  Klaus Hildebrandt,et al.  Fast Approximation of Laplace‐Beltrami Eigenproblems , 2018, Comput. Graph. Forum.

[31]  Dinesh Manocha,et al.  Simplifying polygonal models using successive mappings , 1997, Proceedings. Visualization '97 (Cat. No. 97CB36155).