Showing papers on "Delaunay triangulation published in 1976"
••
TL;DR: In this article, the problem of finding a minimal triangulation of an undirected graph G = (V, E) is considered, and an algorithm for finding an optimal ordering α which produces a minimal set of "fill-in" is presented.
78 citations