计算机工程2012，Vol.38Issue(22)：287-290,4.
Delaunay三角网高效构建及地形仿真应用
Efficient Construction of Delaunay Triangulation Network and Terrain Simulation Application
摘要
Abstract
An efficient algorithm of constructing Delaunay triangulation network based on discrete point set is presented. A large scale data points are pre-processed by sorting with blocks, which makes the next inserting point closely neighboring the newly inserting one, so the algorithm is in accord with the space related theory. When it comes to predicate the location of the next inserting point in which triangles is very time-consuming, it adopts an efficient and robust blending algorithm of the shortest path location including locating the between the point and the triangle by calculating the acreage of triangle and combining the center of gravity of triangle with the relationship between the directed line segment and the point. Consequently, the search numbers of the triangles are decreased and the location of triangles is low time-consuming. While optimizing the local Delaunay triangulation network, it stores all the adjusted edges and vertices by Delaunay Quadtree, which can search effectively. Experimental result proves that applying the algorithm into the 3D terrain simulation makes good natural looking, and the time complexity of whole algorithm is low.关键词
Delaunay三角网/数字高程模型/局部优化过程/3D地形仿真/Flip操作/增量生成算法Key words
Delaunay triangle network/ Digital Elevation Model(DEM)/ Local Optimization Procedure(LOP)/ 3D terrain simulation/ Flip operation/ incremental generation algorithm分类
信息技术与安全科学引用本文复制引用
谭云兰,李光耀,夏浩武,李超,徐祥龙..Delaunay三角网高效构建及地形仿真应用[J].计算机工程,2012,38(22):287-290,4.基金项目
国家"863"计划基金资助项目(2010AA122200) （2010AA122200）
国家科技支撑计划基金资助项目(2012CBA001) （2012CBA001）
上海市科委国际合作基金资助项目(10510712500) （10510712500）
