搜索资源列表
3DPack
- 实用的三维凸包模板，可用于算法竞赛中。可根据实际来选取要使用的代码-3D-Convex’s templelate
graham
- 这是我用matlab写的一个寻找凸包算法的实现，该算法是基于graham算法的一个改进-the source realize an improvement algorithm of searching convex hull which based on graham algorithm in matlab
DataMatic
- DM码的识别，运用凸包法检验条码边缘，采用全局和局部相结合的阈值分割法-DM code identification, use of bar code edge of the convex hull method test, using a combination of global and local thresholding segmentation method
tubao
- 多边形快速形成凸包的算法，使用C++与MATLAB仿真-The polygon rapid formation of the convex hull algorithm, use C++ MATLAB simulation
grahams-scan
- 此为凸包的graham的scan算法，思路清晰，易实现。-This is the convex hull of graham scan algorithm, the idea is clear and easy to implement.
box
- 算法分析与设计中凸包使用蛮力法实现图形用户界面 -Analysis and design of algorithms using the brute force method to achieve the convex hull graphical user interface
TTestMinvexCoh
- 求点集的最小凸包Graham算法。给定平面上的一个点集，找出一个最小点集顺次连结形成一个个凸多边形，使得点集中的点皆在此多边形内或此多边形上，这个凸多边形就是给定点集的二维凸包。 -Demand point set minimum the convex hull Graham algorithm. Given a set of points in the plane, to identify a minimal set of points sequential links forming a
tubaowenti
- 凸包问题，大二一门课的课程设计，很短的小程序-Convex hull, sophomore course curriculum design, very short program
test
- OPencv 第八章成对几何直方图匹配，包含Hu矩的匹配，轮廓凸包检测等-OPencv Chapter VIII of the pairs of geometric histogram matching
manlifa
- 蛮力法求解凸包问题 蛮力法求解凸包问题-Brute force method to solve the convex hull of the brute-force method for solving the convex hull problem
tubao
- 用graham算法在vc环境下编写的形成一个最小凸包程序，能够读入一个点文件，并输出一个点文件。-A minimum convex hull program written using the the graham algorithm in vc environment can be read into a point file and output a point file.
dianyuntubaoyupoufen
- 随机产生三维点云数据，利用程序寻找凸包，然后对凸包进行初始三角剖分-Randomly generated three-dimensional point cloud data, the use of the program to find the convex hull, then the convex hull of the initial triangulation
shiyan
- 空间分析算法的实现，包括道格拉斯算法、角度限差算法、最小凸包等-Realization of spatial analysis algorithms, including the Douglas algorithm, angle tolerances algorithm, the minimum convex hull
Convex
- 使用opencv的函数实现图形图像处理中的凸包缺陷的查找-Use opencv function of the convex hull of the graphics processing defects Find
tubao
- 应用C++ 给定点集，自动生成该点集的最小凸包-Minimum convex hull the application C++ given point set, automatically generate the set of points
convexhull
- 对平面上n个点，求取凸包，并求该凸包面积-convex hull for n points。
quick-convex-hull
- 算法练习之：快速排序实现凸包算法。附有ppt进行详细说明。-Algorithm practice of: algorithm quicksort convex hull. With ppt be described in detail.
TuBao
- 实现凸包算法，可以清晰的看见递归的过程，也可以看出最后的区域-Convex hull algorithm recursive process, you can clearly see, the last area can also be seen
convex-hull
- 这是一个求凸包的算法，效率约为O（n^2)-This is an evaluation of the convex hull algorithm efficiency is about O (n ^ 2)
concave
- matlab表面微结构生成源代码 图片中凹包凸包检测方法 -generate source code Matlab surface microstructure picture concave envelope convex hull detection method