A classic fundamental data structure is the binary tree, which allows us to half a given search space on each search iteration. Usually, this is used on a sorted array, so why not 2D space? Enter, the BSP tree. What is BSP? Binary Space Partitioning...

Now, if you read my last posthttps://dev.to/chigbeef77/line-by-line-but-how-do-i-construct-a-bsp-tree-497n sorry about the length..., you will remember we constructed a BSP tree. The BSP tree we created could hold these entities, but we never actuall...

A classic fundamental data structure is the binary tree, which allows us to half a given search space on each search iteration. Usually, this is used on a sorted array, so why not 2D space? Enter, the BSP tree. What is BSP? Binary Space Partitioning...

Hovertank One was the predecessor of DOOM, Wolfenstein, and Quake, by id software. This will probably be the only 3D game in this series, and even then, this is not true 3D. The challenge is to make this in one day, so first let's create our spec. I'...