A Binary Space Partitioning Tree (BSP Tree) baseline implementation adapted to turtletoy
- resolves all z-index conflicts by splitting polygons
- tree can be traversed in perfect front-to-back order, then using Reinder's polygon's occlusion/clipping method
Log in to post a comment.
// You can find the Turtle API reference here: https://turtletoy.net/syntaxCanvas.setpenopacity(1);