这就是点集自动聚类的算法，基于delaunay三角剖分。-This is the point set automatic clustering algorithm, based on the delaunay triangulation.

Compute nearest neighbours (by Euclidean distance) to a set of points of interest from a set of candidate points. The points of interest can be specified as either a matrix of points (as columns) or indices into the matrix of candidate points.

这是一个提供二维区域Delaunay三角形剖分的 C语言程序。能够对于由折线围成的多空洞、多介质区域，生成指定局部加密的Delaunay三角形剖分。-This is a two-dimensional region to provide Delaunay triangulation of the C language program. The broken line surrounded by long and short hole, multi medium region, generatin