Polygon plate-cutting with a given order

Polygon plate-cutting with a given order

0.00 Avg rating0 Votes
Article ID: iaor20021228
Country: United States
Volume: 31
Issue: 3
Start Page Number: 271
End Page Number: 274
Publication Date: Mar 1999
Journal: IIE Transactions
Authors:
Abstract:

This note is a complement to the paper by Hoeft and Palekar which describes the problem of cutting polygonal shapes from large plates of metal or glass. More specifically, we focus on polynomial time solvability for a number of subproblems of the more general plate-cutting problem. A primary result of this note is the polynomial time solvability for the plate-cutting problem with a given order and convex polygons.

Reviews

Required fields are marked *. Your email address will not be published.