Sorted Vector Paths

A sorted vector path, or SVP, is a processed version of a normal vector path such that it satisfies the `nocross' property, that is, it does not have crossing segments and retains the same winding number as the original vector path. Also, its segments are sorted so that they have monotonically-increasing $y$ coordinates. This allows for very efficient rendering, since the segments can be traversed in scanline order.