If anyone wants to do this, you're looking for "approximate convex decomposition": http://codesuppository.blogspot.com/2006/04/approximate-convex-decomposition.

If anyone wants to do this, you're looking for "approximate convex decomposition": http://codesuppository.blogspot.com/2006/04/approximate-convex-decomposition.html http://codesuppository.blogspot.com/2006/04/approximate-conv... It was one of the grand challenges in the 00's, quietly solved by John Ratcliff. Then a few people solved it after him. It's a fun algorithm. You basically slice and dice, like chopping a potato, then recombine small parts together based on a heuristic.