A Graph Based Algorithm for Generating the Delaunay Triangulation of a Planar Point Set
多尺度形态滤波及弹性匹配技术在类星体谱线识别中的应用

A graph based algorithm for generating the Delaunay triangulation of a planar point set is presented in this paper. The first step is to calculate the Euclidean Minimum Spanning Tree (EMST) of the given points. The EMST is then augumented to triangle mesh. Finally the Delaunay Triangulation of the given points is obtained by local tranformation acording to Max Min angle criteria. The concepts and properties of Voronoi diagram of a planar point set are slso discussed in the paper.