Case Study: Convex Hull

Picture this, ya goober: a huge set of points in space. You want to find the minimum wrapping shape that contains the entire set of points– the convex hull. The goal is to revolve the entire system of points– and have that wrapping shape update dynamically. Sure, you can try to do it the manualContinue reading “Case Study: Convex Hull”