搜索资源列表
tubao
- 凸包算法及实现,供学习和参考使用，-Convex hull algorithm and implementation
tubao
- 数据结构编写的一个凸包程序，主要是算法比较好-Data structure prepared by a convex hull program, better algorithms are mainly
newconvex
- 自写凸包算法，简单实用，连线清晰，算法简练-Since the convex hull algorithm to write simple, practical, connection clear, concise algorithm
lysnake
- 提出了一种自适应的Snake 算法,对于初始包络上的每一点,按照Greedy 算法中的能量公式计算其邻域内各点的能 量. 如果邻域不包含目标的轮廓,则将邻域半径加大,再次计算邻域内各点的能量,直到邻域内包含轮廓点为止. 该算法只需迭 代一次即可得到目标轮廓,而且增大了初始包络的收敛半径,并能够有效处理较高曲率凸形边缘的情况. 对比实验说明了这种 方法的有效性.-Snake proposed an adaptive algorithm, the initial envelope for
poj1873
- poj1873凸包源代码需要的可以参考一下-poj1873tubaosource code can be clean to it
GrahamScan
- Graham凸包扫描算法，算法速度快，很经典的，程序内部注释比较全面。-Graham scan algorithm for convex hull algorithm is fast, very classic, more comprehensive program within the comment.
545454545454545454545454
- 各种凸包生成算法 有卷包法，格雷厄姆法， -all kind of fdfdf
Convexhullproblem
- 点集Q的凸包(convex hull)是指一个最小凸多边形，满足Q中的点或者在多边形边上或者在其内-The convex hull of point set Q (convex hull) is a minimum convex polygon, to meet the Q of the point or the edge of or within this polygon
MinAreaRectangle
- 对平面上的点集，寻找它的最小面积包围矩形，最小周长包围矩形，以及最大距离点对。算法采用了游标卡尺的思想，在找到凸包后时间复杂度为线性。-for finding the minimum area encasing rectangle and the maximum distance pair. The complexity of this algorithm is O(n),so it s very fast.
dlg
- 利用MFC，简单的图形界面，简单的算法，实现凸包的绘制-Using MFC, a simple graphical interface, a simple algorithm to achieve the convex hull of the draw
abc
- 形成凸包并计算面积简洁版，也就是计算几何里面的凸包问题的求解 采用按照斜率的排序 经过试验比网上的模板要快-Hull form and calculate the area of compact version, that is, computational geometry inside the convex hull problem was solved using the sort tested in accordance with the slope of the template fa
ConvHull
- 对于平面上任意给定的一些离散的点，确定这些点的凸包的边界。-For any given plane, a number of discrete points, the convex hull of these points to determine the boundaries.
jisuanjihe
- 其中讲述了计算几何中常用的叉积定义以及应用，凸包算法，还有半平面交算法-Which describes the computational geometry of the cross product definition of commonly used applications, convex hull algorithm, there are half-plane intersection algorithm
GrahamScan
- 凸包最常用的凸包算法是Graham扫描法和Jarvis步进法,该上传文件主要是基于Graham扫描法的凸包算法-convex hull algorithms:based on Graham scan method ~ ~~~~`~·`·`
3_dim_hull_area
- 3维凸包求表面积，增量法，poj上面有相应题目-3 dim hull area
pku_poj_2187
- O(nlogn)凸包问题 poj2187-O (nlogn) convex hull problem poj2187
zhalan
- 运用凸包的生成算法，具体解决了“栅栏”问题，并且有MFC实现的图形界面-Convex hull generation algorithm used, the specific solution to the " fence" issue, and has implemented graphical interface MFC
Convex_hull_problem
- 凸包问题( 分治法与穷举法+测试数据 )-Convex hull problem (divide and conquer and the exhaustive method+ test data)
wykobi_dot_net
- 实现多边形的凸包运算，且能顺利进行多边形三角划分，还有各种其他多边形计算几何之间的处理-Operation to achieve the convex hull of polygons, and can smooth the polygon triangulation, computational geometry and various other polygon processing between
analyse
- 空间分析中相关算法的实现：道格拉斯 插值 光滑 最小凸包 分布中心 分布轴线等-Spatial analysis of related algorithms to achieve: Douglas interpolation smooth distribution of the minimum distribution center axis of the convex hull, etc.