-
Notifications
You must be signed in to change notification settings - Fork 0
Collision Detection
David Xu edited this page Dec 10, 2016
·
1 revision
Spatial hashing seems to best handle cases where items are evenly distributed without a high distribution of sizes (too many large sizes cause items to be found in too many buckets).
Look into hierarchical spatial hashes and see if it would be worth to implement: https://gist.github.com/kirbysayshi/1760774
Alternatives:
- http://www.randygaul.net/2013/08/06/dynamic-aabb-tree/
- Quad/Oct tree
TODO: Highest importance:
- Basic Physics: acceleration, mass, velocity, gravity, forces, etc.
- Basic Camera: coded, non-autonomous movement, world/screen coordinates
- Basic Stages: changing "worlds", loading screens
- Basic DOM interaction: message bus, event handlers