搜索资源列表
-
0下载：
使用QT编写的求多个点的最小凸包算法，有图形显示，使用鼠标画点，最后生成最小凸包。-Written request to use QT minimum number of points the convex hull algorithm, graphical display, use the mouse to draw, and finally generate the smallest convex hull.
-
-
1下载：
凸包算法实现三角网的构建
Convex hull of the triangulation algorithm to build-Convex hull triangulation algorithm to build the Convex hull of the triangulation algorithm to build
-
-
0下载：
运用凸包的生成算法，具体解决了“栅栏”问题，并且有MFC实现的图形界面-Convex hull generation algorithm used, the specific solution to the " fence" issue, and has implemented graphical interface MFC
-
-
0下载：
此为凸包的graham的scan算法，思路清晰，易实现。-This is the convex hull of graham scan algorithm, the idea is clear and easy to implement.
-
-
0下载：
用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.
-
-
0下载：
算法模板，包括叉乘，多边形面积，凸包问题，线段相交等-Algorithm templates, including cross multiplication, polygon area, convex hull problem, line segment intersection, etc.
-
-
0下载：
Voronoi Diagram算法实现主要运用分治法和凸包的方法来实现。
分治法：
1) 该问题的规模缩小到一定的程度就可以容易地解决
2) 该问题可以分解为若干个规模较小的相同问题，即该问题具有最优子结构性质。
3) 利用该问题分解出的子问题的解可以合并为该问题的解；
4) 该问题所分解出的各个子问题是相互独立的，即子问题之间不包含公共的子问题。
-Voronoi Diagram algorithm is mainly using the method of pa
-
-
0下载：
Convex hull algorithm and jarvis Geremi algorithm, two algorithms on a comparison of two algorithms and provides code
-
-
0下载：
凸包问题的算法实现，graham算法实现，分治算法以及暴力算法，有简单图形界面-Convex Hull algorithm problem, graham algorithm, divide and conquer algorithms and violence algorithm, a simple graphical interface
-
-
0下载：
Convex hull algorithm
Algorithms that construct convex hulls of various objects have a broad range of applications in mathematics and computer science.
In computational geometry, numerous algorithms are proposed for computing the convex hull o
-
