Log In Sign Up

Generalized Spectral Coarsening

Reducing the size of triangle meshes and their higher-dimensional counterparts, called simplicial complexes, while preserving important geometric or topological properties is an important problem in computer graphics and geometry processing. Such salient properties are captured by local shape descriptors via linear differential operators - often variants of Laplacian matrices. The eigenfunctions of Laplacians yield a convenient and useful set of bases that define a spectral domain for geometry processing (akin to the famous Fourier spectrum which uses eigenfunctions of the derivative operator). Existing methods for spectrum-preserving coarsening focus on 0-dimensional Laplacian operators that are defined on vertices (0-dimensional simplices). We propose a generalized spectral coarsening method that considers multiple Laplacian operators of possibly different dimensionalities in tandem. Our simple algorithm greedily decides the order of contractions of simplices based on a quality function per simplex. The quality function quantifies the error due to removal of that simplex on a chosen band within the spectrum of the coarsened geometry. We demonstrate that our method is useful to achieve band-pass filtering on both meshes as well as general simplicial complexes.


page 5

page 6

page 7


Nodal domain count for the generalized graph p-Laplacian

Inspired by the linear Schrödinger operator, we consider a generalized p...

Steklov Spectral Geometry for Extrinsic Shape Analysis

We propose using the Dirichlet-to-Neumann operator as an extrinsic alter...

Nonlinear Spectral Geometry Processing via the TV Transform

We introduce a novel computational framework for digital geometry proces...

HodgeNet: Learning Spectral Geometry on Triangle Meshes

Constrained by the limitations of learning toolkits engineered for other...

Gaussian Fourier Pyramid for Local Laplacian Filter

Multi-scale processing is essential in image processing and computer gra...

Why you should learn functional basis

Efficient and practical representation of geometric data is a ubiquitous...

Surface Networks

We study data-driven representations for three-dimensional triangle mesh...