Restricted Mesh Simplification Using Edge Contractions

DOI10.1007/11809678_22zbMath1162.68728OpenAlexW2143377043MaRDI QIDQ3591348

Joachim Gudmundsson, Mattias Andersson, 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

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

Related Items (3)

The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases ⋮ On graph contractions and induced minors ⋮ Analysis and efficiency of the GNG3D algorithm for mesh simplification

This page was built for publication: Restricted Mesh Simplification Using Edge Contractions