The algorithms for constructing of cutter optimal path

zbMATH Open1337.05063MaRDI QIDQ2809837FDOQ2809837

Authors: Tat'jana Anatol'evna Makarovskikh 

Publication date: 30 May 2016

Published in: Journal of Computational and Engineering Mathematics (Search for Journal in Brave)

Recommendations

• Mathematical models and routing algorithms for CAD technological preparation of cutting processes
• Constructing of \(OE\)-postman path for a planar graph
• About routing in the sheet cutting
• Software for the problem of constructing cutting tool paths in CAD/CAM systems for technological preparation of cutting processes
• scientific article; zbMATH DE number 3934748

zbMATH Keywords

plane graphpatheffective algorithmcutting processordered enclosing

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38)

Cited In (5)

• The laser-plotter beam routing problem
• Title not available (Why is that?)
• On the number of \(OE\)-trails for a fixed transition system
• An algorithm for the determination of optimal cutting patterns
• Title not available (Why is that?)

This page was built for publication: The algorithms for constructing of cutter optimal path

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2809837)