Restricted Mesh Simplification Using Edge Contractions

DOI10.1007/11809678_22MaRDI QIDQ3591348zbMATH OpenOpenAlexFDO

Authors Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos

Publication date 10 September 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11809678_22

Mathematics Subject Classification ID

Connectivity (05C40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• RESTRICTED MESH SIMPLIFICATION USING EDGE CONTRACTIONS
• Hierarchy of surface models and irreducible triangulations.
• scientific article; zbMATH DE number 2036491
• A new mesh simplification algorithm based on triangle collapses
• Fast mesh simplification algorithm based on edge collapse

Cited in

(9)

• Mesh parameterization based on edge collapse
• Hierarchy of surface models and irreducible triangulations.
• Analysis and efficiency of the GNG3D algorithm for mesh simplification
• The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases
• On graph contractions and induced minors
• INTERSECTION FREE SIMPLIFICATION
• RESTRICTED MESH SIMPLIFICATION USING EDGE CONTRACTIONS
• scientific article; zbMATH DE number 2247682 (Why is no real title available?)
• Topology-preserving triangulation simplification algorithm by edge contraction

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 Q3591348)