Structure-Aware Mesh Decimation

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 e...

Full description

Saved in:
Bibliographic Details
Published in:Computer graphics forum Vol. 34; no. 6; pp. 211 - 227
Main Authors: Salinas, D., Lafarge, F., Alliez, P.
Format: Journal Article
Language:English
Published: Oxford Blackwell Publishing Ltd 01.09.2015
Wiley
Subjects:
Algorithms
Analysis
Approximation
Collapse
Computer graphics
Computer Science
curves & surfaces
Filtering
Filtration
Graphs
I.3.5 [Computer Graphics]: Computational Geometry and Object Modelling-Curve
level of detail algorithms
solid and object representations
Studies
surface
Topological manifolds
Triangles
mesh decimation
structure-preserving
planar proxy
edge collapse
ISSN:0167-7055, 1467-8659
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 ion, 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. 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 ion, 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.
Bibliography:ark:/67375/WNG-PT86MF3X-7
ArticleID:CGF12531
istex:2A4F721452D9D210BA552AF224D1F9ED810ACE0B
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:0167-7055
1467-8659
DOI:10.1111/cgf.12531