Structure‐Aware Mesh Decimation
- 26 February 2015
- journal article
- Published by Wiley in Computer Graphics Forum
- Vol. 34 (6) , 211-227
Abstract
We present a novel approach for the decimation of triangle surface meshes. Our algorithm takes as input a triangle surface mesh and a set of planar proxies detected in a pre‐processing analysis step, and structured via an adjacency graph. It then performs greedy mesh decimation through a series of edge collapse, designed to approximate the local mesh geometry as well as the geometry and structure of proxies. Such structure‐preserving approach is well suited to planar abstraction, i.e. extreme decimation approximating well the planar parts while filtering out the others. Our experiments on a variety of inputs illustrate the potential of our approach in terms of improved accuracy and preservation of structure.Keywords
Funding Information
- ERC Starting Grant Robust Geometry Processing (257474)
This publication has 18 references indexed in Scilit:
- EFFICIENT DATA STRUCTURE FOR REPRESENTING AND SIMPLIFYING SIMPLICIAL COMPLEXES IN HIGH DIMENSIONSInternational Journal of Computational Geometry & Applications, 2012
- Completion and Reconstruction with Primitive ShapesComputer Graphics Forum, 2009
- Efficient RANSAC for Point‐Cloud Shape DetectionComputer Graphics Forum, 2007
- Simplification of surface mesh using Hausdorff envelopeComputer Methods in Applied Mechanics and Engineering, 2005
- Automatic Generation of Structure Preserving Multiresolution ModelsComputer Graphics Forum, 2005
- Variational shape approximationACM Transactions on Graphics, 2004
- Permission gridsACM Transactions on Graphics, 2002
- Resampling Feature and Blend Regions in Polygonal Meshes for Surface Anti-AliasingComputer Graphics Forum, 2001
- Evaluation of memoryless simplificationIEEE Transactions on Visualization and Computer Graphics, 1999
- Superfaces: polygonal mesh simplification with bounded errorIEEE Computer Graphics and Applications, 1996