Mathematical models and routing algorithms for CAD technological preparation of cutting processes
From MaRDI portal
Publication:2399751
Recommendations
- Software for the problem of constructing cutting tool paths in CAD/CAM systems for technological preparation of cutting processes
- The algorithms for constructing of cutter optimal path
- About routing in the sheet cutting
- Constructing of \(OE\)-postman path for a planar graph
- The estimation of the number of OE-chains and realizable OE-routes for cutting plans with combined contours
Cites work
- scientific article; zbMATH DE number 6007896 (Why is no real title available?)
- scientific article; zbMATH DE number 3825852 (Why is no real title available?)
- scientific article; zbMATH DE number 4051623 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- By-passes with ordered enclosing in planar graphs
- Chain sequences with ordered enclosing
- Cutting path optimization in CNC cutting processes using a two-step genetic algorithm
- Eulerian Cover with Ordered Enclosing for Flat Graphs
- Eulerian graphs and related topics. Part 1, Volume 2
- Local search of orthogonal packings using the lower bounds
- Mathematical models and routing algorithms for CAD technological preparation of cutting processes
- On constructing the shortest circuits on a set of line segments
- On crossings, the crossing postman problem, and the rural postman problem
Cited in
(10)- About routing in the sheet cutting
- The algorithms for constructing of cutter optimal path
- Software for the problem of constructing cutting tool paths in CAD/CAM systems for technological preparation of cutting processes
- Mathematical models and routing algorithms for CAD technological preparation of cutting processes
- Modeling and solving the endpoint cutting problem
- The estimation of the number of OE-chains and realizable OE-routes for cutting plans with combined contours
- Chain sequences with ordered enclosing
- A novel algorithm for construction of the shortest path between a finite set of nonintersecting contours on the plane
- Construction of a technologically feasible cutting with pierce points placement constraints
- Constructing of \(OE\)-postman path for a planar graph
This page was built for publication: Mathematical models and routing algorithms for CAD technological preparation of cutting processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2399751)