搜索资源列表
-
1下载：
算法分析课程中实现的凸包算法,效率很高,有很大的参考价值-algorithm analysis programs to achieve the convex hull algorithms, highly efficient and have great reference value
-
-
1下载：
1113 melkman 凸包算法，O(n),前提是有拓补结构，是一种在线算法-1113 melkman convex hull algorithm, O (n), the premise is expanding premium structure, is an online algorithm
-
-
0下载：
C++ code. Realization of an algorithm for finding an 2D convex hull polygon for input set of 2D points (with glut).
-
-
1下载：
自写凸包算法，简单实用，连线清晰，算法简练-Since the convex hull algorithm to write simple, practical, connection clear, concise algorithm
-
-
0下载：
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
-
-
0下载：
多边形快速形成凸包的算法，使用C++与MATLAB仿真-The polygon rapid formation of the convex hull algorithm, use C++ MATLAB simulation
-
-
0下载：
三维空间中给定任意个点生成一个凸包的算法。-The algorithm in three-dimensional space using given points to generate a convex hull.
-
-
0下载：
C++ Implementation of the convex-hull algorithm for a list of 2D points. Based on the quick-hull algorithm.
-
