MoonsideGames
/
bonk-docs
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

note about spatial hash cell size

main
Evan Hemsley 2019-09-14 22:43:02 -07:00
parent 68a4a1e60b
commit c714660ca7
2 changed files with 6 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
content/broad_phase/_index.md
View File

@ -1,5 +1,5 @@
+++ +++
title = "Broad-Phase Collision" title = "Broad Phase"
date = 2019-09-14T18:33:15-07:00 date = 2019-09-14T18:33:15-07:00
weight = 15 weight = 15
chapter = true chapter = true
@ -8,6 +8,6 @@ pre = "<b>3. </b>"
### Chapter 3 ### Chapter 3
# Broad-Phase Collision # Broad Phase
Fast and inaccurate. Fast and inaccurate.

6
content/broad_phase/spatial_hash.md
View File

@ -6,13 +6,15 @@ weight: 10
In spatial hashing, we place each object into one or more "buckets". Think of a grid covering 2D space. When an object's bounding box covers one of the cells in this grid, it is placed into that cell. Any two unique objects that occupy the same cell are determined to be *potentially colliding*. In spatial hashing, we place each object into one or more "buckets". Think of a grid covering 2D space. When an object's bounding box covers one of the cells in this grid, it is placed into that cell. Any two unique objects that occupy the same cell are determined to be *potentially colliding*.
In Bonk, a spatial hash is defined by its ID type and a cell size. The ID type is used to filter objects. Any two objects with the same ID are assumed to not be colliding. In Bonk, a spatial hash is defined by its ID type and a cell width. The ID type is used to filter objects. Any two objects with the same ID are assumed to not be colliding.
```cs ```cs
var hash = new SpatialHash<Guid>(32); var hash = new SpatialHash<Guid>(32);
``` ```
This spatial hash will use C# **GUID**s as its ID type and a cell size of 32. This spatial hash will use C# **GUID**s as its ID type and a cell width of 32.
There is an art to choosing a cell width. If your cell width is too small relative to the objects in your game, then your objects will occupy many cells, and the hash check will have to check all of those cells for potential collisions. If your cell width is too large, then many objects will be contained in each cell. You are looking for a sweet spot. My rule of thumb is picking a cell width that is roughly twice the size of the most common objects in your game.
To insert an object into the hash, use the **Insert** method and give an ID, an IShape2D, and a Transform2D. To insert an object into the hash, use the **Insert** method and give an ID, an IShape2D, and a Transform2D.