搜索资源列表
convhull
- 设平面上n个点为 ，坐标原点为 。可按照下面方法求得包含这n个点的凸多边形。 (1)求最右边点，即x坐标最大点，设为 。 (2) 以 点为中心，在其余 个点中选取与 逆时针旋转角度最小的点，设为 。 (3)再以 点为中心，在其余 个点中选取与 逆时针旋转角度最小的点 。如此类推，直到新选取的点与 点重合为止。设已求得多边形k个点依次为 ，其中第 点与第1点重合。则分别以点 为三角形顶点计算面积并求和即可。 -Let n points in the plane as the
TSPconvhull
- for solving for TSP, with TSPconvhull that K = convhull(x,y) returns indices into the x and y vectors of the points on the convex hull.
ConvHull
- 对于平面上任意给定的一些离散的点，确定这些点的凸包的边界。-For any given plane, a number of discrete points, the convex hull of these points to determine the boundaries.
TSPconvhullcode
- TRAVELING SALESMAN PROBLEM USING CONVHU-TRAVELING SALESMAN PROBLEM USING CONVHULL
convhull
- Matlab编程考试的一道题。随机生成50个点，计算它的一个凸包，并计算凸包的面积-Matlab programming test a question. Randomly generated 50 points, calculate a convex hull, and calculate the area of ??convex hull
DRLSE_v0 (1)
- 水平集算法分割图像源代码，一种是从内到外分割，一种是外到内分割(Level set segmentation image source code, there are two kinds, one is from inside to outside, and the other is from outside to inside Matlab convhull)
20151030082902308
- 水平集代码，从网上找到的，没有什么特别复杂的。(Level set segmentation image source code, there are two kinds, one is from inside to outside, and the other is from outside to inside Matlab convhull)