Fast algorithm for triangular mesh simplification based on vertex decimation

DOI10.1007/3-540-46080-2_5MaRDI QIDQ4737716zbMATH OpenFDO

Authors Martin Franc, Václav Skala

Publication date 11 August 2004

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2330/23300042.htm

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies and applications (68U99)

Recommendations

• Mesh simplification using the edge attributes
• A new mesh simplification algorithm based on triangle collapses
• Parallel triangular mesh reduction
• Computational analysis of mesh simplification using global error
• Efficient decimation of polygonal models using normal field deviation

Cited in

(8)

• A fast, topology manipulation algorithm for compaction of mesh/faceted models.
• Mesh simplification using the edge attributes
• Decreasing isosurface complexity via discrete fitting
• Parallel triangular mesh reduction
• Computational Geometry Methods and Intelligent Computing
• Efficient decimation of polygonal models using normal field deviation
• INTERSECTION FREE SIMPLIFICATION
• RESTRICTED MESH SIMPLIFICATION USING EDGE CONTRACTIONS

This page was built for publication: Fast algorithm for triangular mesh simplification based on vertex decimation

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