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.