2D Graphic Collision
· 9 min read
TLDR
This article introduces various 2D collision detection methods: from basic Axis-Aligned Bounding Boxes (AABB) and circular collision, to Oriented Bounding Boxes (OBB) and the Welzl algorithm for minimum enclosing circles; from the Separating Axis Theorem (SAT) for convex polygons, to precise pixel-level collision detection; finally covering performance optimization through Hierarchical Bounding Boxes (HBB) and spatial partitioning methods like quadtrees. Different methods are suitable for different scenarios, providing solutions for collision detection from simple geometric shapes to complex irregular figures.
