BMyCrust take as input a 3D scatter points cloud and return a tight, manifold, triangulation. Remember that crust algorithm needs a cloud representing a volume, so open surface may give inaccurate results. For examp

用delaunary算法实现数据的三角网格划分-It is an Algorithm of delaunary for Triangular mesh of data

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

二维Delaunay网格生成工具,是MIT一个数学博士所写。利用了matlab内建的delauny和delaunayn。不支持Constrained Delaunay-2D Delaunay mesh generation tools