Optimal cutting directions and rectangle orientation algorithm
From MaRDI portal
Recommendations
- Simplest optimal cutting patterns for equal rectangles
- An algorithm for the determination of optimal cutting patterns
- A recursive algorithm for optimal guillotine-cutting of equal rectangles
- Dynamic programming algorithms for the optimal cutting of equal rectangles
- A computational improvement to the dynamic programming algorithm for the optimal cutting of equal rectangles
- Generating optimal cutting patterns for rectangular blanks of a single size
- On optimal cuts of hyperrectangles
- Corner cutting algorithms associated with optimal shape preserving representations
- scientific article; zbMATH DE number 1225305
- Simple Cuts Are Fast and Good: Optimum Right-Angled Cuts in Solid Grids
Cites work
Cited in
(9)- Optimal orientations of cells in slicing floorplan designs
- Ernesto de Queirós Vieira Martins (1945-2000): An appreciation by Mário S. Rosa
- Trees, slices, and wheels: On the floorplan area minimization problem
- Complexity and approximability results for slicing floorplan designs.
- Cuttings for Disks and Axis-Aligned Rectangles
- Simple Cuts Are Fast and Good: Optimum Right-Angled Cuts in Solid Grids
- Cutting rectangles avoiding rectangular defects
- A shape preserving corner cutting algorithm with an enhanced accuracy
- Corner cutting algorithms associated with optimal shape preserving representations
This page was built for publication: Optimal cutting directions and rectangle orientation algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1303735)
