Delaunay triangulation and Voronoi diagrams for Riemannian manifolds

During the process,feature-map of the image was extracted at first,followed by the mesh generation for the purpose of image representation using Floyd-Steinberg algorithm and 2-D Delaunay triangulation algorithm.

Based on Delaunay triangulation and its local updating property,this algorithm can update the changed region directly under the circumstances that only part of the source images has been changed.

A new growth algorithm for creating delaunay triangulation:outside insertion algorithm;

The research of skeletonization algorithm based on Delaunay triangulation;

Study on an algorithm for fast constructing Delaunay triangulation;

In this paper,the problems of Bowyer algorithm for Delaunay triangulation are analyzed and a modified Delaunay method is presented.

A constrained Delaunay triangulation is yielded from the points set and then a graph is attained too.

The natural element method uses the Voronoi tessellation,the natural neighbournode and the natural neighbour interpolation to construct the approximatefunction,and the solution of equation is based on the Delaunay triangulation bythe Galerkin method.

The creation of delaunay triangulation network based on second Development of MapX;

By collecting data of underwater terrains in different periods,based on the digital altitude model generated by the Delaunay triangulation network and the volumetric change of the local spatial area of a river,by taking the 3D spatial vertical triangular prism as the fundamental element,and by making full use of the VBA s power-ful v.