Efficient Simplification Methods for Generating High Quality LODs of 3D Meshes

被引:2
作者
Muhammad Hussain
机构
[1] DepartmentofComputerScience,KingSaudUniversity
关键词
polygonal models; simplification; LOD modeling; multi-resolution modeling;
D O I
暂无
中图分类号
TP391.41 [];
学科分类号
080203 ;
摘要
<正>Two simplification algorithms are proposed for automatic decimation of polygonal models,and for generating their LODs.Each algorithm orders vertices according to their priority values and then removes them iteratively.For setting the priority value of each vertex,exploiting normal field of its one-ring neighborhood,we introduce a new measure of geometric fidelity that reflects well the local geometric features of the vertex.After a vertex is selected,using other measures of geometric distortion that are based on normal field deviation and distance measure,it is decided which of the edges incident on the vertex is to be collapsed for removing it.The collapsed edge is substituted with a new vertex whose position is found by minimizing the local quadric error measure.A comparison with the state-of-the-art algorithms reveals that the proposed algorithms are simple to implement,are computationally more efficient,generate LODs with better quality,and preserve salient features even after drastic simplification.The methods are useful for applications such as 3D computer games,virtual reality,where focus is on fast running time,reduced memory overhead,and high quality LODs.
引用
收藏
页码:604 / 613
页数:10
相关论文
共 7 条
[1]   Moment-based metrics for mesh simplification [J].
Tang, H. ;
Shu, H. Z. ;
Dillenseger, J. L. ;
Bao, X. D. ;
Luo, L. M. .
COMPUTERS & GRAPHICS-UK, 2007, 31 (05) :710-718
[2]  
Mesh Simplification Using an Area-Based Distortion Measure[J] . Insu Park,Shahram Shirani,David W. Capson.Journal of Mathematical Modelling and Algorithms . 2006 (3)
[3]   Generating high-quality discrete LOD meshes for 3D computer games in linear time [J].
Chen, Hung-Kuang ;
Fahn, Chin-Shyurng ;
Tsai, Jeffrey J. P. ;
Chen, Rong-Ming ;
Lin, Ming-Bo .
MULTIMEDIA SYSTEMS, 2006, 11 (05) :480-494
[4]   Variational shape approximation [J].
Cohen-Steiner, D ;
Alliez, P ;
Desbrun, M .
ACM TRANSACTIONS ON GRAPHICS, 2004, 23 (03) :905-914
[5]   Surface simplification using a discrete curvature norm [J].
Kim, SJ ;
Kim, CH ;
Levin, D .
COMPUTERS & GRAPHICS-UK, 2002, 26 (05) :657-663
[6]   CONVERGENCE OF CURVATURES IN SECANT APPROXIMATIONS [J].
FU, JHG .
JOURNAL OF DIFFERENTIAL GEOMETRY, 1993, 37 (01) :177-190
[7]  
A survey of polygonal simplification algorithms .2 D. Luebke. Technical Report TR97-045 Department of Computer Science, University of North Carolina at Chapel Hill . 1997