搜索资源列表
QuickHulldemo
- 快速凸包演示程序 演示了快速凸包算法的执行过程-Fast convex hull demo program to demonstrate fast convex hull algorithm of the implementation process
convexl
- The convex hull of a set of points is the smallest convex set that contains the points. This paper presents a convex hull algorithm that combines the 2-d Quickhull algorithm with the general dimension.
qhull-2010.1
- 一个快速实现三维凸包的程序,并且有Delaunay三角化，半平面交，voronoi图。-a 3D quickhull program，and has delaunay triagulation,half intersection,voronoi programs.
qhull-2012.1
- Qhull computes the convex hull, Delaunay triangulation, Voronoi diagram, halfspace intersection about a point, furthest-site Delaunay triangulation, and furthest-site Voronoi diagram. The source code runs in 2-d, 3-d, 4-d, and higher dimensions. Qhul
cpptgp_3e
- 碰撞检测经典算法检测包QUICKHULL,运行于二维空间和三维空间的替代算法-The classical collision detection algorithm to detect packet QUICKHULL, replacement algorithm in two-dimensional and three-dimensional space
qhull-2015.2
- 最新版的qhull 用于快速实现三维凸包,并且有Delaunay三角化，半平面交，voronoi图。programs.-a 3D quickhull program，and has delaunay triagulation,half intersection,voronoi
Qhull-2019.1
- Qhull computes the convex hull, Delaunay triangulation, Voronoi diagram, halfspace intersection about a point, furthest-site Delaunay triangulation, and furthest-site Voronoi diagram. It runs in 2-d, 3-d, 4-d, and higher dimensions. It implements the