计算机应用研究2016，Vol.33Issue(12)：3912-3915,4.DOI:10.3969/j.issn.1001-3695.2016.12.088
局部特征熵的网格非均匀简化算法
Local feature entropy based mesh non-uniform simplification algorithm
摘要
Abstract
Aiming to solve the issue that the accuracy and efficiency after the simplification of 3D model is difficult to be balanced,this paper proposed a new simplified algorithm based on half-edge collapse nonhomogeneous mesh method of local characteristic entropy.It detected clustering local area twice.Firstly,it detected edge clustering local area where there were 3D data points to obtain normal vector in the area.Secondly,it detected the normal vector of secondary regional clustering area by the constraints of the gravity center of the region near 3D data points.According to the definition of information entropy,it took the local area characteristic entropy constructed by angle information between the two normal vectors from the two detection method as the half edge collapse cost.The bigger the local area characteristic entropy was,the flatter the region tends to be,and the priority of simplification should be given to this,otherwise it should be retained.Lastly,it retained the triangle regularity in the simplified mesh judged by the interior angles to reduce the deformation caused by the error.The experimental results show that the algorithm can achieve a better balance in the accuracy and time efficiency of the local details.关键词
聚类/网格简化/法向量/特征熵/非均匀/半边折叠Key words
cluster/mesh simplification/normal vector/characteristic entropy/inhomogeneous/half-edge collapse分类
信息技术与安全科学引用本文复制引用
温佩芝,黄佳,李丽芳,朱立坤..局部特征熵的网格非均匀简化算法[J].计算机应用研究,2016,33(12):3912-3915,4.基金项目
广西科技攻关项目（桂科攻14124005-2-9）；图像图形智能处理重点实验室研究课题（LD15043X）；研究生创新资助项目 （）
