Premium
Structure‐Aware Mesh Decimation
Author(s) -
Salinas D.,
Lafarge F.,
Alliez P.
Publication year - 2015
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/cgf.12531
Subject(s) - decimation , polygon mesh , adjacency list , computer science , planar , graph , algorithm , set (abstract data type) , surface (topology) , enhanced data rates for gsm evolution , abstraction , topology (electrical circuits) , mathematics , geometry , theoretical computer science , computer graphics (images) , artificial intelligence , combinatorics , computer vision , filter (signal processing) , philosophy , epistemology , programming language
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.