A handcrafted collection of 3D convex hull implementations.
- QuickHull3D: A Robust 3D Convex Hull Algorithm in Java. O(n log(n)) complexity, works with double precision
- C++ implementation of the 3D QuickHull algorithm. O(n log(n)) complexity. Can be included as header.
- CGAL library convex hull based on quickhull. O(n log(n)) complexity. Require building/installation of CGAL. Static version works faster than dynamic.
- Incremental convex hull in C++. O(n^2) complexity.
- S-hull: a fast sweep-hull routine for Delaunay triangulation in C++. O(n log(n)) complexity. Require library building/installation.
- Qhull. Performance is balanced in the sense that the average case happens on average. For more details read http://www.qhull.org/html/qh-code.htm#performance
- 3D Convex Hull in C. Header only library. Uses QuichHull algorithm.
- Covex hull algorithms in 3D. Complexity analysis, details and pseudocode for gift wrapping, divide and conquer, incremental algorithm
- 3D convex hulls. Basics, complexity, naive, explanation of gift wrapping, divide and conquer, incremental approaches
- Convex Hulls in 2d and 3d. Visual explanation, complexity analysis and pseudocode for gift wrapping, Graham scan, incremental, divide and conquer, Chan’s algoritms for 2D case and same for gift wrapping and divide and conquer for 3D case.
- Convex hull in 3 dimensions. Complexity analysis in 2D and 3D, details on Graham scan, gift wrapping, divide and conquer, quick hull, Chan's, online algoritms: Preparata's and Overmars & van Leeuven in 2D. Gift wrapping, divide and conquer, incremental and conflict graph in 3D.
- A Minimalist’s Implementation of the 3-d Divide-and-Conquer Convex Hull Algorithm. Good for educational purposes
- 3D fast convex-hull-based evolutionary multiobjective optimization algorithm. Incremental convex hull with average time complexity reduced to O(n log(n)).