Skip to content

Commit 2e1835a

Browse files
committed
Updates README.md
1 parent 9eee863 commit 2e1835a

File tree

1 file changed

+7
-0
lines changed

1 file changed

+7
-0
lines changed

README.md

Lines changed: 7 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -19,7 +19,14 @@ The problem with that brute-force-approach is, that the number of checks grow ve
1919

2020
So you somehow have to narrow down your collision-candidates.
2121
This piece of software does that for you. It does not do the collision checks themself. It just tells you if a sprite may be near enough to a second one to maybe collide with it, which allows you to do a collision test for those two, or three, or five sprites instead of the whole bunch.
22+
23+
> **If you like this repo, please don't forget to star it.**
24+
> **Thank you.**
25+
26+
27+
2228
## What It Really Does...
29+
2330
...is a simple trade-off.
2431
You may query it about the sprites around your coordinate or rectangle, but your sprites have to register with it and update their position/AABB on every update.
2532
But all in all this is a lot faster than a simple brute-force check.

0 commit comments

Comments
 (0)