What is DAABBCC?
A Dynamic AABB Tree is a binary search algorithm for fast overlap testing. Dynamic AABB trees are good for general purpose use, and can handle moving objects very well. The data structure provides an efficient way of detecting potential overlap between objects. DAABBCC does not contain narrow-phase collision detection.
You can use it whenever precise collision manifold(narrow-phase) is not required.
You can use the DAABBCC in your own project by adding this project as a Defold library dependency.
Open your game.project file and in the dependencies field under project add:
This is a complete rewritten version by using Box2D’s Dynamic Tree.
- API revised and simplified
- Nearly 6x performance increment according to v1.x (4800 sprites vs 500 sprites)
- Low cpu usage
- Experimental narrow phase collision detections removed