微型机与应用Issue(15)：65-68,4.
一种改进的用于三维DT剖分的三角网生长算法
An improved triangulation growth algorithm for 3D delaunay triangulation
摘要
Abstract
Triangulation growth algorithm has its unique advantages, but researches about developing it into an 3d algorithm are much more less than the ones about developing incremental insertion algorithm, divide & conquer algorithm and their compound algorithm. This paper studies the algorithm for 3d delaunay triangulation by developing triangulation growth algorithm, optimizes the original algorithm with k-nearest neighbors thought so that algorithm time complexity becomes O ( NlogN ) , the optimization is valid both for 2d and 3d algorithm. Uses ArcGIS Engine secondary development program to achieve data manipulation, algorithm implementation, and display of two three-dimensional mesh graph, some ArcGIS related functions and other data mining algorithms modules can be easily added to the program. Taking six sets of point data as example for experimental analysis, grid construct time comparison verifies the ability of the algorithm.关键词
三维 DT 剖分/三角网生长法/k 近邻思想/AEKey words
three-dimensional delaunay triangulation/triangulation growth/k-nearest neighbours thought/arcgis engine分类
测绘与仪器引用本文复制引用
许克平..一种改进的用于三维DT剖分的三角网生长算法[J].微型机与应用,2014,(15):65-68,4.基金项目
国家高技术研究发展计划（863计划）课题 （）
