Location:
Search - convex java
Search list
Description: 经典的凸包算法。JAVA语言编写。绝对正确。
Platform: |
Size: 3065 |
Author: 孔明 |
Hits:
Description: 实现Convex Hull算法的JAVA源代码。
Platform: |
Size: 7970 |
Author: luozhan |
Hits:
Description: 一个绘制Voronoi图和Delauany三角剖分的程序,并且给出了求凸包的算法。该程序可以演示如何进行三角剖分,帮助你理解整个剖分过程。-a Voronoi diagram mapping and triangulation Delauany procedures, and is seeking a convex hull algorithms. The procedure can demonstrate how triangulation, and help you understand the subdivision process.
Platform: |
Size: 157696 |
Author: 晓琳 |
Hits:
Description: 这是一个用java写的三角剖分程序源码,需要的可以看一看-This is a java was made with the source triangulation process, the need to look at the
Platform: |
Size: 5120 |
Author: 刘广忠 |
Hits:
Description: 经典的凸包算法。JAVA语言编写。绝对正确。-Classic convex hull algorithm. JAVA language. Absolutely correct.
Platform: |
Size: 3072 |
Author: 孔明 |
Hits:
Description: 凸多边形最优三角剖分,代码开放,彼此交流-Optimal convex polygon triangulation, code open exchange
Platform: |
Size: 97280 |
Author: wyj |
Hits:
Description: 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 a "rubber band" around all the points, and let it wrap as tight as it can. The resultant polygon is a convex hull.
Platform: |
Size: 12288 |
Author: NeeL |
Hits:
Description: 凸包jarvis算法以及格雷米算法,对两种算法进行一个比较,并且提供两种算法的代码-Convex hull algorithm and jarvis Geremi algorithm, two algorithms on a comparison of two algorithms and provides code
Platform: |
Size: 6144 |
Author: robert |
Hits:
Description: 由一堆离散点,自动生成它的最小外包多边形,及凸壳。-By a bunch of discrete points, it is automatically generated out of the smallest polygon, and the Convex Hull.
Platform: |
Size: 5120 |
Author: 荆凯旋 |
Hits:
Description: Another convex hull algoritm for 3d points in java
Platform: |
Size: 17408 |
Author: Kivu |
Hits:
Description: In this project, three convex hull algorithms are implemented in java. Three algorithms are Brute Force, Graham’s Scan and Jarvis’ March.
Platform: |
Size: 9216 |
Author: zephrion |
Hits:
Description: 实现Java凸包算法,但是有一些小问题,例如数组越界。-Convex hull algorithm that implements the Java
Platform: |
Size: 21504 |
Author: Tom |
Hits:
Description: 用的分治法的思想,凸包顶点正好可以构成循环,感觉比较新颖,就是不断顺时针旋转,按照书上那个公式不断找出左边的点和顶点,不断存入到数组中,最后的输出刚好是顺时针的输出,创建了好几个数组,其中还有一个三维数组,用法比较特殊,无意间想到的-Ideological divide and conquer, the convex hull of the vertices can just constitute a cycle, feeling relatively new, is constantly rotate clockwise, in accordance with the formula in the book constantly find the left point and vertex, continuously stored into the array, the final output just clockwise output, create several arrays, which there is a three-dimensional array, use special inadvertently think
Platform: |
Size: 1026048 |
Author: liyi |
Hits:
Description: Java implementation of fast convex hull algorithm
Platform: |
Size: 1024 |
Author: ukl |
Hits:
Description: convex hull code in java
Platform: |
Size: 1024 |
Author: vani |
Hits:
Description: 简单的凸包演示软件,在面板中画点,点击计算作图即可演示。上传的是源代码,需要在命令行编译成字节码文件再运行即可。(Simple convex package demo software, draw points in the panel, click the calculation diagram to demonstrate.)
Platform: |
Size: 1024 |
Author: 艾斯提斯 |
Hits: