搜索资源列表
-
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下载：
凸包的应用文件（包裹法求凸包的算法）
写得比较经典-Convex hull of the application files (packages Method of Convex Hull algorithm) written in the classical comparison
-
-
0下载：
Convex Hull Algorithm Implemetation in ASP C#
-
-
0下载：
利用MFC，简单的图形界面，简单的算法，实现凸包的绘制-Using MFC, a simple graphical interface, a simple algorithm to achieve the convex hull of the draw
-
-
0下载：
运用凸包的生成算法，具体解决了“栅栏”问题，并且有MFC实现的图形界面-Convex hull generation algorithm used, the specific solution to the " fence" issue, and has implemented graphical interface MFC
-
-
0下载：
凸包算法的界面化实现，可以计算点集的凸包。-The interface of the convex hull algorithm to achieve, we can calculate the convex hull of point set.
-
-
0下载：
C#编写的凸包算法,计算机图形学中的东西~C#编写-tubao convex hull algorithm Oh good things
-
-
0下载：
周培德翻译的《计算几何:算法设计与分析》中的凸包算法，在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
-
-
0下载：
此为凸包的graham的scan算法，思路清晰，易实现。-This is the convex hull of graham scan algorithm, the idea is clear and easy to implement.
-
-
0下载：
求点集的最小凸包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
-
-
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下载：
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
-
-
0下载：
实现凸包算法，可以清晰的看见递归的过程，也可以看出最后的区域-Convex hull algorithm recursive process, you can clearly see, the last area can also be seen
-
-
0下载：
本代码主要实现土包问题的算法，采用Graham扫描算法，随机生成指定数量的点，求解其凸包。代码中包含注释-The code of the main problems of soil packet algorithm, using Graham scan algorithm to randomly generate a specified number of points, solving its convex hull. Code contains annotations
-
-
0下载：
算法模板，包括叉乘，多边形面积，凸包问题，线段相交等-Algorithm templates, including cross multiplication, polygon area, convex hull problem, line segment intersection, etc.
-
-
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下载：
凸包算法，包括暴力穷举法，递归算法等，最后使用opengl将所有的凸包顶点绘制-Convex hull algorithms, including violence exhaustive method, recursive algorithm, and finally use opengl all the convex hull VertexPaint
-
-
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
-
