This is an explanation of the algorithm needed to use the subtractive tri fill for filling the embedded planar graph of 3D meshes. In about 3 weeks time, i'm going to share a project with a modified version of the algorithm which works better. A heads up. Don't worry if you can't understand it, it is rather complicated.
One cool thing about this method is a triangle drawn with the subtractive tri fill can be drawn in only 1 line! Some on paper tests show that up to 50% of triangles will overlap but once i've implemented the algorithm I can test this a bit better.
