搜索资源列表
JAVA中实现Convex Hull算法
- 实现Convex Hull算法的JAVA源代码。
Planer_convex_hull
- A Convex Hull is the smallest convex polygon that contains every point of the set S. A polygon P is convex if and only if, for any two points A and B inside the polygon, the line segment AB is inside P. One way to visualize a convex hull is to put
hull
- 凸包jarvis算法以及格雷米算法，对两种算法进行一个比较，并且提供两种算法的代码-Convex hull algorithm and jarvis Geremi algorithm, two algorithms on a comparison of two algorithms and provides code
Convex_Hull_Algorithm
- 由一堆离散点，自动生成它的最小外包多边形，及凸壳。-By a bunch of discrete points, it is automatically generated out of the smallest polygon, and the Convex Hull.
src
- Another convex hull algoritm for 3d points in java
ConvexHull
- In this project, three convex hull algorithms are implemented in java. Three algorithms are Brute Force, Graham’s Scan and Jarvis’ March.
JavaConvexHall
- 实现Java凸包算法，但是有一些小问题，例如数组越界。-Convex hull algorithm that implements the Java
java
- 用的分治法的思想,凸包顶点正好可以构成循环,感觉比较新颖,就是不断顺时针旋转,按照书上那个公式不断找出左边的点和顶点,不断存入到数组中,最后的输出刚好是顺时针的输出,创建了好几个数组,其中还有一个三维数组,用法比较特殊,无意间想到的-Ideological divide and conquer, the convex hull of the vertices can just constitute a cycle, feeling relatively new, is constantly r
convexhull
- Java implementation of fast convex hull algorithm
convexhull
- convex hull code in java