搜索资源列表
ConvexHull
- 使用C++实现的Graham扫描法（求解凸包问题），可设置生成随机点的个数、样式，同时支持设置显示范围、显示算法处理时间及使用文件导入导出点等功能。（文件格式为，头四个字节是点的个数，以后分别是各个点的x坐标和y坐标，每个数值均占4字节）。
convexhull
- convexik jan convexik
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
- In this project, three convex hull algorithms are implemented in java. Three algorithms are Brute Force, Graham’s Scan and Jarvis’ March.
ConvexHull
- C++ Convex Hull algorithm
ConvexHull_matlab
- 最小凸包的实现程序，用matlab编程的源码，使用的不是matlab自带的凸包函数，而是自己编的，有详细的运算流程图，一看就懂，main为主程序，ConvexHull为函数。-ConvexHull，matlab，with Flow Diagram
convexhull
- C++ Implementation of the convex-hull algorithm for a list of 2D points. Based on the quick-hull algorithm.