MathDB1 problem
- 0 votes0 replies1 view
Strong NP-hardness of milling grid polyhedra
Grid-polyhedron milling conjecture. The problem remains strongly NP-hard when the pocket is a grid polyhedron.
Strong NP-hardness of milling grid polyhedra
Grid-polyhedron milling conjecture. The problem remains strongly NP-hard when the pocket is a grid polyhedron.