大规模地形散乱点的快速构网算法  

A Fast TIN Generation Algorithm Based on Large-scale Unorganized Terrain Points

作　　者：李学军[1] 王林旭[1] 吴涢晖[2] 王新波[2,3] 

机构地区：[1]装备指挥技术学院信息装备系 [2]装备指挥技术学院研究生院 [3]中国人民解放军61541部队

出　　处：《计算机仿真》2009年第11期211-214,共4页Computer Simulation

摘　　要：针对大规模视景仿真地形显示的需要,提出了一个利用大规模地面散乱点构建地形三角网格的算法。先将空间的散乱点投影到XOY坐标平面,在坐标平面上对散乱点进行均匀网格划分,然后按照一定顺序将大规模散乱点组织成若干不相交的单调链,由相邻单调链连接成单调多边形,利用单调多边形的特点快速构建初始三角网格模型,并在空间上对模型进行三角网格优化。通过加入辅助点的方法,有效解决了网格边沿的奇异情况。算法在保证网格质量的同时,大幅减少了构网的时间开销,证明了提高网络的速度。Aiming at the characteristics of terrain data, a TIN generation algorithm is proposed. First, the unorganized points are projected onto the XOY coordinate plane, and are divided into many parts by a regular net. Then, the paper organizes those points in several monotonous chains according to a certain axis order, and makes use of the characteristic that monotonous chains are easy to set up triangular mesh quickly. In the end, the triangular mesh is optimized by normal methods. The boundary shape is not very good by this algorithm, then by adding some accessorial points, the abnormity in the mesh boundary is solved effectively. This algorithm promised the mesh quality, and the time cost is greatly reduced.

关 键 词：散乱数据点 不规则三角网格 单调链 边界异常 网格优化 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]