Convex Hull
The convex hull of a shape is the smallest convex set that contains it.
- from
- Computational Geometry
- added
- 2026-10-10
- likes
- 0
similar
-
-
Qhull qhull.org
Convex hull, Delaunay triangulation, Voronoi diagram, halfspace intersection about a point, etc. (C/C++, custom open source license, GitHub)
-
Convex Hull Algorithms erencan-02.github.io
A website with visualizations of many convex hull algorithms, including gift wrapping, Graham's scan, quickhull, divide and conquer, monotone chain, and Chan's algorithm.
-
convex-hull npmjs.com
-
-
Convex Optimization stat.cmu.edu
Computational Geometry › Algorithm Visualizations: “The convex hull of a shape is the smallest convex set that contains it.”