{"version":"1.0","type":"rich","title":"BSP Tree","description":"A Binary Space Partitioning Tree (BSP Tree) baseline implementation adapted to turtletoy\r\n\r\n- resolves all z-index conflicts by splitting polygons\r\n- tree can be traversed in perfect front-to-back order, then using Reinder's polygon's occlusion\/clipping method","author_name":"ge1doot","author_url":"https:\/\/turtletoy.net\/user\/ge1doot","provider_name":"Turtletoy","provider_url":"https:\/\/turtletoy.net\/","license":{"fullName":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International","shortName":"CC BY-NC-SA 4.0","url":"https:\/\/creativecommons.org\/licenses\/by-nc-sa\/4.0\/"},"thumbnail_url":"https:\/\/turtletoy.net\/thumbnail\/80a8a43733.jpg","thumbnail_width":512,"thumbnail_height":512,"html":"<iframe src=\"https:\/\/turtletoy.net\/embed\/80a8a43733\" width=\"1025px\" height=\"554px\" style=\"max-width: 100%; border: 0\" sandbox=\"allow-scripts allow-top-navigation allow-top-navigation-by-user-activation allow-forms allow-popups allow-same-origin\"><\/iframe>","width":1025,"height":554}