Abstract: A node-based algorithm of Delaunay triangulation is proposed, which aims at
supplying local triangulation requirements. The algorithm is based on the locality of Delaunay
triangulation and its dual Voronoi graph. Local Delaunay meshes are generated by searching
Minimum Voronoi Neighbors for each point. The background assistant grid is proposed to
improve the efficiency. The theoretical proof, programming implementation and efficiency
analysis of the algorithm are given. Finally, several practical applications of the algorithm are
introduced.

Key words: Delaunay triangulation, minimum Voronoi neighbors, node-based model