If there's no overlaps to consider only a fraction of that work needs to be done. Namely what I phrased as "decomposing the path & tracing the outline into the output bitmap", without need for its outerloop.
This is split into substeps: splitting the shape & generating the bounding box.
There's some legacy functions that are commented due to memory issues.
The vast majority of the code goes into efficiently computing different tweening functions. There's also debugging functions.
2/4?