凸包Convex hull运算(求离散点的边界)
[k,a] = convhull(x,y);
K = convulln(X, options);[K AV] = convexHull(DT);
tsearch :搜索Delaunay三角形
delaunay :Delaunay三角化
dsearch :求最近点 (这是两个有趣的函数)
inpolygon :搜索多边形内的点
凸包Convex hull运算(求离散点的边界)
[k,a] = convhull(x,y);
K = convulln(X, options);