基于微元网格扩张的三角剖分算法关键问题研究

Research on the Key Problems of Triangulation Algorithm Based on the Micro-cell Mesh Expansion

研究了在基于微元网格扩张的三维散乱数据点的空间直接三角剖分算法的实现过程中,散乱数据点的空间划分方法、存储结构、空间点与直线的位置关系判断、空间多边形顶点凹凸性判断以及三角网格的法向一致化等关键问题。

During the course of realizing direct triangulation algorithm from 3D scattered points based on the micro-cell mesh expansion, the key problems are researched in detail, such as the partition method and save structure of scattered points, the location relation between point and line in space, the nature estimation for convexo-concave vertices of space polygon vertex and the perpendicular vectors consistency of triangulation mesh, etc.