Studied the paper quite a bit, and looked at the plane sweep paradigm algorithm(s).
Starting with a letter, lines which will become tool paths can be arrayed.
One use of the intersect script can find all the points, but may not be needed.
Using Boolean intersect, all of the tool path line elements i,j can be made from the lines.
Using trim, all of the boundary curve segments can be created, of which about half are used.
A list or array of all of the left and right endpoints of the line elements would need to be made. (MoI knows the start and end points)
A list or array of all of the left (upper) and right endpoints of the boundary curve segments would be needed.
Select a start point and generate the sub-path, using points which match and a few simple rules. Repeat loop.
Some of the uppermost, and lowermost boundary curve segments may need some tweaking.

So a script could probably be done, with a lot of work(?)

Had some fun manually creating some zigzags.

- Brian