搜索资源列表
ConvexHull
- 使用C++实现的Graham扫描法（求解凸包问题），可设置生成随机点的个数、样式，同时支持设置显示范围、显示算法处理时间及使用文件导入导出点等功能。（文件格式为，头四个字节是点的个数，以后分别是各个点的x坐标和y坐标，每个数值均占4字节）。
ConvexHull
- 多边形最小外接矩形算法，在CodeProject上下载的，共享-Minimum bounding rectangle polygon algorithm, download CodeProject, shared
convexhull
- 用动态链表实现求凸壳的程序（卷包裹法），供三角网实现编程的人参考-Using dynamic list for the Convex Hull of the realization of procedures (vol Parcel law) for the triangular network programming reference
convexhull
- The Graham scan examines the points one by one and eliminates the points which cause reflexive angles
5-18
- 由 点 集合 序列 或者 数组 创建 凸外形-opencv convexhull
convexhull
- convexik jan convexik
hull
- 凸包jarvis算法以及格雷米算法，对两种算法进行一个比较，并且提供两种算法的代码-Convex hull algorithm and jarvis Geremi algorithm, two algorithms on a comparison of two algorithms and provides code
convexhull
- 用于求解凸包问题！包围所有的定点！ -Convex hull for the solution of the problem!
Convexhull
- 现有一硬件采集了人在一固定大小的平面上的压力中心点，采集了很多数据，现在要求用vb算出一组压力中心点的凸包，以便显示人在这一时段的活动范围-A collection of existing hardware in a fixed plane the size of the center of pressure, a lot of data collection, and now requires a set of pressure vb calculate the center of the
Convex_Hull_Algorithm
- 由一堆离散点，自动生成它的最小外包多边形，及凸壳。-By a bunch of discrete points, it is automatically generated out of the smallest polygon, and the Convex Hull.
ConvexHull
- imagestone source code
ConvexHull
- Convex Hull Algorithm Implemetation in ASP C#
ConvexHull
- convex hull using quick hu-convex hull using quick hull
convexhull
- an application for convex hull in visual c++ on windows platform using openCv library a -an application for convex hull in visual c++ on windows platform using openCv library a a a a a a a a a a a
convexhull
- Scanner in java which read and tokenises the code
ConvexHull
- Convex Hull algorithms
Convexhull
- 凸包 凸包问题的实现 有无数点，求能包含这些点的图形的最小面积-Convex hull Convex hull problem of realization there are numerous points, seek to include these points, the graphics, the minimum size
convexhull
- face detection and hand recognition
ConvexHull
- In this project, three convex hull algorithms are implemented in java. Three algorithms are Brute Force, Graham’s Scan and Jarvis’ March.
ConvexHull
- 凸包(ConvexHull)就是把给定点包围在内部的，面积最小的凸多边形。时间复杂度为O(n)先计算凸包，输入点数组p，点个数为n，输出点数组ch。函数返回凸包顶点数。(The convex hull (ConvexHull) is the smallest convex polygon that surrounds the point to its interior. The time complexity is O (n). First, the convex hull is compute