Hi Mark,
No sorry we haven't. thanks for reminding us. It would be nice to have at least one other User show interest and try it.
Also trying to determine the best way for it to be accomplished and at what level.
There is already a mechanism to subdivide segments and arcs. But instead of dividing in half recursively as done currently, I think it should be changed to divide by N in order to get more equal length segments like in the Transform method we tried. Otherwise the segment lengths can vary by a factor of 2.
There is also a mechanism to delay/buffer the segments to see if they can be combined which I believe is similar to the what would be needed for filtering. Which also includes detection of where the path ends and any uncombined segments need to be flushed/processed.