Concepts3
⚙️AlgorithmAdvanced
Minkowski Sum
The Minkowski sum A ⊕ B adds every point of set A to every point of set B, and for convex polygons it can be computed in O(n + m) by merging edge directions.
#minkowski sum#convex polygon#edge merge+12
⚙️AlgorithmIntermediate
Rotating Calipers
Rotating calipers is a geometric two-pointer technique that sweeps two (or more) parallel support lines around a convex polygon.
#rotating calipers#antipodal pairs#convex hull+12
⚙️AlgorithmIntermediate
Convex Hull
The convex hull is the smallest convex polygon that contains all given points, like a rubber band snapped around nails on a board.
#convex hull#graham scan#monotone chain+12