搜索资源列表
tubao
- 寻找凸包算法的MFC可视化实现,对大家学习会有帮助。-Find convex hull algorithm MFC Visualization.
drilling-vibration-
- 调用matlab程序，利用凸包原理，实现了钻柱振动监测，程序源代码可见，但实测数据保密-Call matlab procedures, the use of convex hull principle, to achieve the drill string vibration monitoring, program source code visible, but the measured data privacy
jmMixing
- 利用Csharp编程语言实现某些常用的空间分析算法，要求具备基本的图文功能界面，所有实验均集成在同一系统中，要求实现如下功能 1．曲线抽样算法的实现 要求采用2种不同的算法进行曲线抽样，并分别对抽样的效果进行评价和比较。 2．离散点群空间分布参数的计算 要求计算空间点群的各种空间分布参数，如分布密度、各种分布中心、分布轴线、离散度等。 3．曲线插值与光滑算法的实现 要求利用任意两种不同的插值算法实现曲线的插值与光滑，并进行对比分析。 4．膨胀系数的计算与最小凸包的
skin_hull
- skin localisation with hull convex
find-mobile-user
- To find a triangulation of minimal total edge length. That is, an input polygon or the convex hull of an input point set must be subdivided into triangles that meet edge-to-edge and vertex-to-vertex, in such a way as to minimize the sum of the perime
convex_hull
- 凸包问题的算法实现，graham算法实现，分治算法以及暴力算法，有简单图形界面-Convex Hull algorithm problem, graham algorithm, divide and conquer algorithms and violence algorithm, a simple graphical interface
OTMatlab
- 凸包绘制源程序Matlab的实现,凸包Matlab绘制-Convex hull draw Matlab source implementations
graham
- Graham s scan algorithm for finding convex hull using linked list.
jarvin
- Jarvis march algorithm for finding convex hull using linked list
Util
- Python code Hull files
My-Documents
- 包含自然图像图库；灰度处理；角点检测；凸包处理最终得到大致感兴趣区域-Contains natural image gallery gradation processing corner detection convex hull treatment finally get roughly the area of interest
60394
- 计算凸包，用于图像图形处理，可以基本准确的缺点凸包-Convex hull computing
elementordering
- Graham算法，对形成不规则三角网的最小凸包点进行寻找，并形成最小凸闭包-Graham algorithm, the minimum convex hull point to form a triangular irregular network was looking to form a minimum convex closure
FingerDetect
- 使用kinect读取视频，利用分离前景，对图像进行前景连通检测，寻找每个指尖 寻找每个手指的凸包点和凹陷点，求取掌心-Use kinect reads the video, using a separation prospects, prospects for image communication is detected, searching each fingertip search of each finger convex hull points and depressed points
tmutamt
- was 0.5, 0.5 points on the hull are considered outside. -was 0.5, 0.5 points on the hull are considered outside.
ConvexHull
- The indices returned in order describe the convex hull.
3D-Convex-Hall_struct
- 构建三维凸包 给出很多的点坐标，然后根据算法要求构建凸包-Construction of three-dimensional convex hull We give a lot of point coordinates, and then build the convex hull algorithm according to the requirements of
sanjiao
- 最小权重三角划分。输入一个多边形顶点坐标，输出具有最小权重的三角划分。-The minimum-weight triangulation problem is the problem of finding a triangulation of minimal total edge length. That is, an input polygon or the convex hull of an input point set must be subdivided into triangles
syn9_2
- 评估圆形度、椭圆短长轴比、图斑与外接矩形面积比、等面积圆周长与图斑周长比、凸包周长与图斑周长比等5个形状特征，选出用于对灰度图像G形状分割时的最佳指标组合。-Assessment roundness, oval short major axis ratio of the circumscribed rectangular polygon area ratio, etc. polygon area and perimeter circumference ratio, convex hull sha
ConvexHull
- 凸包示例程序，可以演示凸包效果，对初学者有一定帮助-Convex hull sample program, can demonstrate the effect of the convex hull, there is some help for beginners