dc340c16a6
Qhull computes convex hulls, Delaunay triangulations, halfspace intersections about a point, Voronoi diagrams, furthest-site Delaunay triangulations, and furthest-site Voronoi diagrams. It runs in 2-d, 3-d, 4-d, and higher dimensions. It implements the Quickhull algorithm for computing the convex hull. Qhull handles roundoff errors from floating point arithmetic. It computes volumes, surface areas, and approximations to the convex hull. OK jasper@
6 lines
288 B
Plaintext
6 lines
288 B
Plaintext
MD5 (qhull-2010.1-src.tgz) = 5kE4RwrN6xj3UqC8KhHOtA==
|
|
RMD160 (qhull-2010.1-src.tgz) = hAUw8NEDz6C9htAiakEISGbdXKI=
|
|
SHA1 (qhull-2010.1-src.tgz) = 7UgJEuA+/ddnGVwGx+jCUseBErE=
|
|
SHA256 (qhull-2010.1-src.tgz) = VXCF+0Qbm1okWJ4I17GucezSNPy0PvT4/94UHSLjFr4=
|
|
SIZE (qhull-2010.1-src.tgz) = 674457
|