Mathematical models and routing algorithms for economical cutting tool paths

Resource-efficient technologies for cutting sheet materials allow for the contours of cut-off details to be overlapped. This includes the Intermittent Cutting Problem and the Endpoint Cutting Problem. This paper reviews mathematical models of such resource-efficient cutting processes and suggests algorithms for defining the cutter route under technological constraints. As soon as a cutting plan is given, optimisation with shortening the total length of idle passes. No information of the detail shape is required to define the sequence of detail cutting. This is why all curves without self-intersections and contiguities that are a constituent part of detail boundaries may be interpreted as edges of the plane graph G, and all points of intersection and contiguity may be interpreted as vertices of the graph G. Up to homeomorphism, plane graph G can be represented by a list of edges [Formula omitted.] with incident vertices [Formula omitted.] and faces [Formula omitted.] . This allows the restrictions of the planed cutter trajectory to be formalised in terms of graph theory. A series of algorithms for constructing the permitted route in the plane graph G as an image of the cutting plan is suggested. The constructed route for the graph G can be interpreted as a tool trajectory for the cutting plan which is the inverse image of graph G.