
Proceedings Paper
New algorithm of mesh simplification based on the gradient of curvatureFormat | Member Price | Non-Member Price |
---|---|---|
$17.00 | $21.00 |
Paper Abstract
Mesh simplification is an efficient method to reduce the time of computer handling complicated models. It requires the
algorithm with less processing time and space complexity, while the quality of simplification and the consistency of the
simplified triangles are quite well. This paper presents a mesh simplification algorithm of three-dimensional models
defined by triangle-mesh. In this algorithm, the gradient of the curvature of surface is used as the simplification condition,
the manner of simplification is edge collapse and the error metrics is the distance between vertex before simplifying and
the related surface after simplifying. Experiment results indicate that this algorithm can be applied to any topological
mesh and has the advantages of speediness and efficiency.
Paper Details
Date Published: 20 May 2009
PDF: 4 pages
Proc. SPIE 7283, 4th International Symposium on Advanced Optical Manufacturing and Testing Technologies: Optical Test and Measurement Technology and Equipment, 72834N (20 May 2009); doi: 10.1117/12.828833
Published in SPIE Proceedings Vol. 7283:
4th International Symposium on Advanced Optical Manufacturing and Testing Technologies: Optical Test and Measurement Technology and Equipment
Yudong Zhang; James C. Wyant; Robert A. Smythe; Hexin Wang, Editor(s)
PDF: 4 pages
Proc. SPIE 7283, 4th International Symposium on Advanced Optical Manufacturing and Testing Technologies: Optical Test and Measurement Technology and Equipment, 72834N (20 May 2009); doi: 10.1117/12.828833
Show Author Affiliations
Qing-yang Wu, Shenzhen Univ. (China)
Fan Yang, Shenzhen Univ. (China)
Published in SPIE Proceedings Vol. 7283:
4th International Symposium on Advanced Optical Manufacturing and Testing Technologies: Optical Test and Measurement Technology and Equipment
Yudong Zhang; James C. Wyant; Robert A. Smythe; Hexin Wang, Editor(s)
© SPIE. Terms of Use
