搜索资源列表
TSP_G
- 利用凸包的原理,求解70个城市的旅行商问题.用Matlab实现-use of convex hull of principle, solving 70 cities in the TSP. Using Matlab
Gramham-CH
- Gramham法求解凸包。从最基本数据结构定义开始实现，有图形界面和动画演示。全套代码。-Gramham method convex hull. Data from the most basic definition of the structure began to realize, graphics and animation interface demo. A full set of code.
tubaoTest
- 凸包算法的实现，用的控制台程序，不过已经能够说明问题了-convex hull algorithm for the realization of the console procedures, but has been able to illustrate the problem
convex_hull
- 算法分析课程中实现的凸包算法,效率很高,有很大的参考价值-algorithm analysis programs to achieve the convex hull algorithms, highly efficient and have great reference value
TSP_G
- 在分离粘连颗粒时通过求取凸包从而得到凸缺，进而找到分离点-Adhesions in the separation of particles through the strike in order to be convex convex hull missing, and then find the separation point
Convex
- 凸包算法 vc 6.0 实现用户输入点凸包-Convex hull algorithm for vc 6.0 user input convex hull
graham
- Graham convex hull sofware
Planer_convex_hull
- A Convex Hull is the smallest convex polygon that contains every point of the set S. A polygon P is convex if and only if, for any two points A and B inside the polygon, the line segment AB is inside P. One way to visualize a convex hull is to put
Convex_hull.cpp.tar
- ACM凸包标程,可以快速使用凸包的各种应用，满足需求。-ACM convex hull source file
gaimc-1.0
- 一个常用的计算机图论算法包 包含常用的图论算法 如dijkstra 凸包-A commonly used computer algorithms graph theory package contains the commonly used graph theory algorithms such as convex hull, and so dijkstra
convex
- C++ code. Realization of an algorithm for finding an 2D convex hull polygon for input set of 2D points (with glut).
convex
- gram法求凸包， 凸包是区域内任意两点的直线不与边界相交的简单闭区域。 gram算法能够高效地求解出凸包的点集-gram Method convex hull, convex hull is a straight line between any two points within the region do not intersect with the boundary simple closed area. gram algorithm can efficiently solve
convexer
- simple program for computing the convex hull of one shape in a binary image
Convex_hull_problem
- 凸包问题( 分治法与穷举法+测试数据 )-Convex hull problem (divide and conquer and the exhaustive method+ test data)
ConvexHull
- In this project, three convex hull algorithms are implemented in java. Three algorithms are Brute Force, Graham’s Scan and Jarvis’ March.
ch_check2
- MATLAB code for convex hull program
quick-convex-hull
- 算法练习之：快速排序实现凸包算法。附有ppt进行详细说明。-Algorithm practice of: algorithm quicksort convex hull. With ppt be described in detail.
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
Implementation of convex hull
- 实现凸包实现，采用MATLAB编写代码，用于凸包算法的快速实现。(Implementation of convex hull)
Convex hull implementation code
- 使用C语言编程，实现凸包的快速生成，提高了运算的效率。(Using C language programming, realize the rapid generation of convex hull, improve the efficiency of the operation.)