搜索资源列表
graham
- Graham扫描算法 ： 大体思路是将不是凸包顶点的点从点集中去掉。 找出S中具有最小y坐标的点p（通过选取最左边的点打破平局） 根据点和p的连线 与 x轴正方向所成的角度，对S中的点进行排序（由小到大），并将p放在最前面。 从p点开始扫描排序后的S集合。如果这些点都在凸包上，则每三个相继的点p1,p2,p3满足以下性质：p3在向量<p1,p2>的左边.如果出现相继的三个点p1,p2,p3不满足上述性质，则p2点一定不是凸包的顶点，应立即去除。-Grah
GIS-tuqiao
- 给定点群凸壳生成算法,GIS的核心算法之一。-Generate the core algorithm of the algorithm, GIS is one of the convex hull of a given point group
CONVEXHULL
- 周培德翻译的《计算几何:算法设计与分析》中的凸包算法，在Visual Studio2008平台用C#语言编写的基于页面的二维凸包生成程序。本人拥有自主版权！-Zhou s translation, "Computational Geometry: algorithm design and analysis" of the convex hull algorithm, written in C# in Visual Studio2008 platform packet generation pa
shiyan
- 将背景与前景从视频中分割开 并将前景进行多边形或凸包处理-Background and foreground separated from the video and The foreground polygon or convex hull
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
manlifa
- 蛮力法求解凸包问题 蛮力法求解凸包问题-Brute force method to solve the convex hull of the brute-force method for solving the convex hull problem
-MTF_HULL_TREND
- 好用的趋势指标,建议跟随操作，支持所有MT4平台-Hull Trend
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
quxianbianzhixian
- 用在AUTO CAD里面把船体二维型线图上的曲线复制后粘贴成相同长度的直线-Used in AUTO CAD inside curve of the hull on the two-dimensional chart copy and paste into the straight line of the same length
qhull-2012.1
- Qhull computes the convex hull, Delaunay triangulation, Voronoi diagram, halfspace intersection about a point, furthest-site Delaunay triangulation, and furthest-site Voronoi diagram. The source code runs in 2-d, 3-d, 4-d, and higher dimensions. Qhul