Click to go to the next slide I came up with an idea for how BSP could be done closer to it's standard implementation aka without linked lists for the tree polygon pointers, so as to make it easier to understand, implement and importantly more efficient. The key idea here is to use non-fragment dynamic memory and tombstones. This project has 5 blocks. I spent longer writing these instructions than on making it. You could also use this as a tutorial for BSP, I guess, but it's not very visual. I don't have time to implement it right now, but will do in the future.
