Delaunay三角网构建是3维场景可视化领域的一个热点也是难点问题。归纳总结了现有Delaunay三角网构建研究中的3类方法——逐点插入法、三角网生长法和分治法，以及在各自原理框架下的不同实现算法；比较分析了3种不同方法的优缺点和各自代表性算法的时间复杂度，并详细讨论了Delaunay三角网构建方法在大规模场景渲染和地形可视化领域中未来3个研究方向：混合算法研究、算法支撑技术研究和分布式并行算法研究。

Delaunay triangulation reconstruction is a hotspot but hard problem in 3D scene rendering and visualization field. In this paper, a review of Delaunay triangulation development is given, and then three current kinds of Delaunay triangulation methods are summarized: incremental method, triangle expanding method and divide-and-conquer method. Moreover, several kinds of algorithms under the frame of each triangulation method are compared in terms of advantage, disadvantage and complexity. Finally, directions of future work of Delaunay triangulation methods in large-scale scene rendering and terrain visualization field have been discussed, including research on algorithm combination, algorithm supporting technology and distributed parallel algorithm.