Overview
Broad phase collision detection uses simple bounds or spatial partitions to reduce the number of expensive pairwise checks.
Quickly finds possible colliding object pairs before exact collision tests.
Compact metadata for implementation and discovery.
Broad phase collision detection uses simple bounds or spatial partitions to reduce the number of expensive pairwise checks.
Quick facts
Runtime and memory behavior at a glance.
Best
O(n)
Average
O(n log n + k)
Worst
O(n^2)
Space
O(n)
test precise collision only if bounds overlapSends only overlapping bounds to the narrow phase.
Show state updates, constraints, and error correction over simulation steps.
Broad Phase Collision Detection operates in O(n log n + k) time and O(n) space within the Collision Detection family. Key governing relation: test precise collision only if bounds overlap. Often compared with Narrow Phase Collision Detection and Sweep and Prune.
What each reference supports for this entry.
Reference for broad-phase and narrow-phase collision detection, bounding volumes, and geometric robustness.
Open sourceGood next jumps from the relationship graph, ranked for useful discovery.
Geometry · Foundation
Broad phase commonly uses bounding boxes for cheap overlap checks.
Compare with thisSimulation · Core
Rigid-body simulation pipelines use broad phase to find possible contacts.
Compare with thisBroad phase commonly uses bounding boxes for cheap overlap checks.
Broad phase selects candidate pairs before precise tests.
Sweep and prune is a common broad-phase strategy.