2D BSP Tree test BSP (Binary Space Partitioning) is a classic 3D rendering algorithm that sorts 3D polygons by depth to solve hidden surface removal without a Z-buffer.
Project Reference https://people.wku.edu/qi.li/teaching/446/cg10_hidden_surfaces.pdf