bartolomej/quadtree-collision

Visualization of quad tree collision detection algorithm.

Quadtree collision

Visualization of quadtree collision detection algorithm.

Algorithm

• Rebuild tree at every step
• Retrieve a list of collision candidates
• Calculate if those candidates collide
• Perform update logic ...

Parameters

• node capacity - maximum number of items in any given sub-quadrant
• max tree depth - maximum quad tree depth

📚 Resources

• Mike Chambers - JavaScript QuadTree Implementation
• Game Development - Use QuadTrees to detect likely collisions
• Tyler Scott - Quadtrees and Octrees for Representing Spatial Information
• Dev.Mag quadtrees implementation
• Geometry in Action - Quadtrees and Hierarchical Space Decomposition