搜索资源列表
-
0下载：
如何将无序的多边形顶点集合，排序成逆时针顺序!这个正是凸包算法前面的一些准备工作!-how to disorderly polygon vertex assembly, sequencing into a counter-clockwise order! This is why the convex hull algorithm front of some preparation work!
-
-
0下载：
凸壳算法用了少许opengl,有交互界面，操作简单，用鼠标就可以完成。-convex hull algorithm with a bit opengl, interface, simple operation, using the mouse can be completed.
-
-
1下载：
计算几何中，用VC++实现的求点集凸包的包裹算法-computational geometry, with VC point for the collection of parcels convex hull algorithm
-
-
0下载：
凸包算法的实现，用的控制台程序，不过已经能够说明问题了-convex hull algorithm for the realization of the console procedures, but has been able to illustrate the problem
-
-
0下载：
凸包最常用的凸包算法是Graham扫描法和Jarvis步进法.本程序用Graham扫描法实现凸包的绘制-convex hull of the most commonly used convex hull algorithm is scanning and Graham Jarvis stepping law. The procedures used G raham scanning method to achieve the convex hull mapping
-
-
2下载：
凸包算法 vc 6.0 实现用户输入点凸包-Convex hull algorithm for vc 6.0 user input convex hull
-
-
0下载：
基于最优凸壳技术的Delaunay三角剖分算法-Convex Hull based on optimal technology Delaunay triangulation algorithm
-
-
1下载：
凸包算法实现三角网的构建
Convex hull of the triangulation algorithm to build-Convex hull triangulation algorithm to build the Convex hull of the triangulation algorithm to build
-
-
1下载：
由一堆离散点，自动生成它的最小外包多边形，及凸壳。-By a bunch of discrete points, it is automatically generated out of the smallest polygon, and the Convex Hull.
-
-
0下载：
Convex Hull Algorithm Implemetation in ASP C#
-
-
0下载：
关于图像最小凸包的一系列算法,该算法主要运用于OpenCV 中的MinAreaBox()函数中 用于确定图像的倾斜角度-With regard to image the smallest convex hull of a series of algorithm, which mainly used OpenCV in MinAreaBox () function is used to determine the image of the tilt angle of
-
-
0下载：
三维场景中的三维凸壳算法及实现。可用鼠标转动场景，可用鼠标拖动凸壳的各顶点。-Three-dimensional scene in three-dimensional convex hull algorithm and implementation.
-
-
0下载：
凸包算法 基于JarvisMarch的凸包算法-Convex hull algorithm
-
-
0下载：
C++ code. Realization of an algorithm for finding an 2D convex hull polygon for input set of 2D points (with glut).
-
-
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
-
-
1下载：
算法练习之：快速排序实现凸包算法。附有ppt进行详细说明。-Algorithm practice of: algorithm quicksort convex hull. With ppt be described in detail.
-
-
0下载：
这是一个求凸包的算法，效率约为O（n^2)-This is an evaluation of the convex hull algorithm efficiency is about O (n ^ 2)
-
-
0下载：
Convex hull algorithm and jarvis Geremi algorithm, two algorithms on a comparison of two algorithms and provides code
-
-
0下载：
构建三维凸包
给出很多的点坐标，然后根据算法要求构建凸包-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
-
-
0下载：
matlab convex hull 详细算法(Detailed algorithm for matlab convex hull)
-
