I wanted to compare my two "sorting" algorithms RadixSort and FastBSP for quality. So here's a simple project where you can swap between the two. (WASD to move, Arrow keys to look around) This is not a game, but if you want to "play" without lag go here: https://turbowarp.org/717989328?fps=60&hqpen 1. Quality: It's clear that 3D BSP is miles better in quality compared to a z sort based approach. Radix sort also has it's own funky limitation on max z distance which is apparent here. 2. Speed: It's worth noting that whilst Fast BSP is definitely faster than Radix Sort, BSP caused 118 splits, which radix doesn't do, so a fairer comparison would be to compare with Radix Sort on the unsplit model, which actually causes Radix Sort to be faster! Radix sort is much faster than quicksort though.
