RESTRICTED MESH SIMPLIFICATION USING EDGE CONTRACTIONS

DOI10.1142/S0218195909002940MaRDI QIDQ5322315zbMATH OpenOpenAlexFDO

Authors Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos

Publication date 20 July 2009

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0218195909002940

zbMATH Keywords

algorithmmesh simplificationedge contractionsplanar triangular mesh\(k\)-step vertex removal

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• Restricted Mesh Simplification Using Edge Contractions
• Hierarchy of surface models and irreducible triangulations.
• Mesh simplification using the edge attributes
• A new mesh simplification algorithm based on triangle collapses
• scientific article; zbMATH DE number 2087065

Cites work

• Hierarchy of surface models and irreducible triangulations.
• Optimal Search in Planar Subdivisions
• Planarity-preserving clustering and embedding for large planar graphs
• Reconfiguring triangulations with edge flips and point moves

Cited in

(5)

• scientific article; zbMATH DE number 2247682 (Why is no real title available?)
• The complexity of contracting bipartite graphs into small cycles
• The complexity of contracting bipartite graphs into small cycles
• Quadratic error metric mesh simplification algorithm based on discrete curvature
• Restricted Mesh Simplification Using Edge Contractions

This page was built for publication: RESTRICTED MESH SIMPLIFICATION USING EDGE CONTRACTIONS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5322315)