BSP Trees Part 3

Been on hold for more than half a year - continuation of using BSP trees to hold triangles.

Using a Binary Space Partitioning tree to classify points inside an icosahedron. One of the preliminary steps before doing solid boolean operations. On the 2D side of things, have been thinking that since BSP trees point location method only works when the normals to the polygon are correctly working, need to implement a method that corrects this based on an alternate method where you cast rays.