I have several drawings from SVG files which basically contain basic outlines of figures. They are constructed in segments of various shapes (lines, ellipse arcs, Bezier curves ect.) Something like this (maybe not the best example):
I want to create an algorithm that traces (draws over) the countour of all shapes once. This means that it has to jump from one figure to an other (or to the same figure) at various points. Also it should prefer go from right to left. I guess it could be represented by a weighted undirected graph where the edges represent the shapes, but each node is also connected to all other nodes via jump. The jump could then have high weights as well as the nodes to the right. I would then have to create a trail, except that the jumps would have to be visited. I don't know... I not good at graph theory.
I know this is vague, but maybe someone knows of a path (or trail)-finding algorithm where expensive jumps are allowed or something like that. Maybe some network or complexity stuff?
EDIT: Thanks for all the response. It is already very useful. But I see that it wasn't clear at all what I meant and how anyone could answer. So, Let me clarify:
I'm making software for a laser die cutter. It has to cut shapes from an SVG file on a long scrolling sheet of paper beneath. The laser cutter can cut lines and ellipse arcs (not bezier curves :-( ) with simple instructions, as well as making jumps; basically lines with the laser off, but a little faster. It also auto-corrects for the motion of the paper below.
So my first approach is to take each segment from the SVG and translate it to a single instruction for the laser (maybe I'll translate Bezier curves to elliptical arcs, but I can't seem to fin a good approximation that way). The question is then: Which order should I execute the instructions? and derived from that: How fast can I scroll the paper?