RESTRICTED MESH SIMPLIFICATION USING EDGE CONTRACTIONS

DOI10.1142/S0218195909002940zbMath1183.65017OpenAlexW2100836694MaRDI QIDQ5322315

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)

Related Items (2)

Quadratic error metric mesh simplification algorithm based on discrete curvature ⋮ The complexity of contracting bipartite graphs into small cycles

Cites Work

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

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