Spatial Hashing #31
Merged
Spatial Hashing #31
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
aevyrie
force-pushed
the
spatial-hashing
branch
from
7cb2bec to
f169b58
Compare
aevyrie
force-pushed
the
spatial-hashing
branch
from
6900c85 to
a813b71
Compare
aevyrie
force-pushed
the
spatial-hashing
branch
from
38d39b8 to
eb4535c
Compare
aevyrie
force-pushed
the
spatial-hashing
branch
from
261d95f to
2e06a97
Compare
|
Partitioning: |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Implements spatial hashing, to performantly run distance checks, find all entities located in the same cell, or neighboring cells.
Finding all entities in a
GridCellis a single pre-hashed lookup, so it only takes ~ns. Finding all entities in a cell and its 26 neighbors takes only ~100ns. You can query for neighbors within any radius, but this becomes exponentially more expensive. This also provides aneighbors_floodto find all contiguous cells that have entities in them, recursively. This is useful to find islands of occupied cells, intended to be used for placing physics simulation instances. Neighbor flood is extremely dependent on the amount of objects and their arrangement in the scene, in this case it takes 1.6ms.The numbers above come from the added benchmarks, running on a MPB M3 Max, with 10,000 entities moving around a cube of 50 cells^3.