狄洛尼三角剖分在LOD点删除简化中的应用探讨

LOD(Level of Details)层次细节模型的提出为三维复杂场景的实现提供了有力的技术支持.LOD简化通过顶点删除、边压缩、面片收缩操作来减少场景中的面片数,降低场景复杂度从而加快绘制速度.利用点删除操作进行模型简化时,需要对删除顶点后所形成的多边形"空洞"进行三角化再剖分,不同的剖分方法所形成的三角形网格质量是不同的.引入有限元网格剖分的概念,使用狄洛尼(Delaunay)三角剖分法则,提出对凸闭包自身三角化构建方法,对一个凸多边形进行了最优的剖分.所形成的三角形网格满足狄洛尼法则中的最大-最小角特性和空外接圆特性两个重要原则.

LOD VERTEX DELETION SIMPLIFICATION OPERATION BASED ON DELAUNAY TRIANGULATION

Level of Details Model firmly supports the three-dimensional complex scene construction.LOD simplification,consisting of operations of vertex deletion,edge compression and mesh grid contraction,decreases the number of mesh grids in scene and reduces the scene complexity,so that the rendering process is speeded up.During the operation of vertex deletion,the hole formed by the points removing must be redivided by triangulating.The triangle grids produced by various dividing method are different.The concept of finite element grid division is introduced,and the Delaunay triangulation principle is applied.Also a convex hull self-triangulating construction method is presented,and a convex polygon is divided into the most optimistic division,The divided triangle grids conform to the two principles of the Delaunay Law,the Max-Min angle feature and the empty circumcircle character.