摘要
提出了改进的基于顶点视觉重要度的模型简化算法,该简化算法在顶点视觉重要度的计算中采用了顶点单位法向量法,目的是使处于平面内的顶点优先进行简化,从而使模型视觉尖锐的地方得到了很好的保持。在边折叠时,采用狭长三角形最大最小角方法及边角和法,增加模型的逼真性。最后,通过与QEM简化算法比较得出,本文简化算法较好地保持了模型的视觉特征,模型数据存储量也有大幅度减少,并缩短了简化时间。
This paper presents a simplified algorithm of vertex model based on the importance of visual improvement,the algorithm adopts vertex unit vector method in calculating the importance degree of vertex vision,so that in the plane of the first vertex simplification of visual sharp place was well maintained. In the folded edge,the narrow triangle method and the maximum and minimum angle edge angle and method,Finally,by comparing with the QEM algorithm,we can find that the simplified algorithm can maintain the visual characteristics of the model,reduce the data storage of the tilt model and shorten the time.
引文
[1] Isler V,LauRW H,Green M. Real time multire solutionmodeling for complex virtual environments Proceedings ofACM Symposium on Virtual Reality Software and Technol-ogy[M].Hong Kong:ACM Press,1996.
[2] Lounsbery M, DeRose T,Warren J. Multiresolutionanalysis for surfaces of arbitrary topological type[J]. ACMTrans. on Graphics,1997,16(1):34-73.
[3] A.Kalvin,R. Taylor.Superfaces:Polygonal Mesh Simplifi-cation with Bounded Error[J]. IEEE Computer Graphicsand Application,1996,16(3):64-77.
[4]滕书娟.一种保持视觉特征的LOD模型简化算法[J].计算机工程与应用,2010,46(33):164-168.
[5]顾耀琳,赵争鸣,魏江涛.距离加权的二次误差测度多分辨率网格简化[J].计算机工程与设计,2007,28(8):1 966-1 968.
[6]张果,刘旭敏,关永.一种基于近似曲率的边折叠简化算法[J].计算机应,2009,29(3):729-731.
[7] De Haemer Jr,Michael J,Zyda. Simplification of objectsrendered by polygonal approximations[J]. Computer&Graphics,1991,15(2):175-184.
[8]陶志良,潘志庚,石教英.基于能量优化的网格简化算法及其应用[J].软件学报,1997,8(12):881-888.
[9] Garland M,Heckbert P S. Simplification using quadricerror metrics[J]. Computer Graphics,1997,31(3):209-216.
[10]姚童仙.LOD模型简化算法的研究与实现[M].兰州:兰州交通大学,2014.