AABB

• • Specified by p_minand p_max.

  • Center c = (p_min+p_max)/2.

  • Size s = p_max - p_min.

Closest point to AABB

• • The point is p and the closest point will be q.

  • For each axis in p check if value is below min then set that axis in q it to min and if above max set it to max. This will push p along each axis towards the box.

  • If any axis position is inside the box it will remain in the box.

Intersect two AABB.

• • Check each axis. If no overlap in axis then boxes to not intersect.

  • If all axis overlap then they intersect.

Intersect AABB and plane.

Intersec Sphere vs AABB

Reference

• • Swept AABB Collision Detection and Response - 2013

  • Min, Max under negation and an AABB trick - 2013

  • Dynamic AABB Tree - 2013

  • XNA 4.0 Bounding Box from a Model - 2011

  • XNA 4.0 Bounding Box from a Model - 2011

  • AABB from OBB with component-wise abs - 2010

  • AABB from OBB with component-wise abs - 2010

  • When Two Hearts Collide: Axis-Aligned Bounding Boxes - 2000

  • An Axis-Aligned Bounding Box (AABB) Sweep Test - 1999

  • A Box-Sphere Intersection Test - 1999

• Dynamic AABB Tree