Point in Polygon

For a very long time have been meaning to clean up this code. It uses a binary space partitioning tree to represent a polygon with the added use that it can classify whether a point is in the polygon very quickly. Below is 100,000 points classified in about 0.1s.

Now just need to adapt this for 3D polyhedra which is a stepping stone to 3d boolean operations on meshes.

The reason this actually came about though, was that I needed to cap the 'Extruded solids" that was coming from the IFC files in the post below. For some reason could not get the OpenGl Glu's Tessalotor working and am not sure if its another one of those 64-bit problems as I can't get an debugging errors.