Computes convex hulls, Delaunay triangulations, Voronoi diagrams, half-space intersections about a point, furthest-site Delaunay triangulations, and furthest-site Voronoi diagrams. It runs in 2-d, 3-d, 4-d, and higher dimensions.
Qhull
Qhull code for Convex Hull, Delaunay Triangulation, Voronoi Diagram, and Halfspace Intersection about a Point
2024-07-03
Science, Math, Geometry, Computational Geometry - Qhull. Computes convex hulls, Delaunay triangulations, Voronoi diagrams, half-space intersections about a point, furthest-site Delaunay triangulations, and furthest-site Voronoi diagrams.