Polygon plate-cutting with a given order

Research output: Contribution to journalArticle

Abstract

This note is a complement to the paper by Hoeft and Palekar [1] 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 plalecutting problem with a given order and convex polygons.

Original languageEnglish (US)
Pages (from-to)271-274
Number of pages4
JournalIIE Transactions (Institute of Industrial Engineers)
Volume31
Issue number3
DOIs
StatePublished - 1999

Fingerprint

Polynomials
Glass
Metals

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering

Cite this

Polygon plate-cutting with a given order. / Dror, Moshe.

In: IIE Transactions (Institute of Industrial Engineers), Vol. 31, No. 3, 1999, p. 271-274.

Research output: Contribution to journalArticle

@article{4f74d0c1fd2445c3ac1f4f1729d51038,
title = "Polygon plate-cutting with a given order",
abstract = "This note is a complement to the paper by Hoeft and Palekar [1] 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 plalecutting problem with a given order and convex polygons.",
author = "Moshe Dror",
year = "1999",
doi = "10.1080/07408179908969826",
language = "English (US)",
volume = "31",
pages = "271--274",
journal = "IISE Transactions",
issn = "2472-5854",
publisher = "Taylor and Francis Ltd.",
number = "3",

}

TY - JOUR

T1 - Polygon plate-cutting with a given order

AU - Dror, Moshe

PY - 1999

Y1 - 1999

N2 - This note is a complement to the paper by Hoeft and Palekar [1] 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 plalecutting problem with a given order and convex polygons.

AB - This note is a complement to the paper by Hoeft and Palekar [1] 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 plalecutting problem with a given order and convex polygons.

UR - http://www.scopus.com/inward/record.url?scp=85023789263&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85023789263&partnerID=8YFLogxK

U2 - 10.1080/07408179908969826

DO - 10.1080/07408179908969826

M3 - Article

AN - SCOPUS:85023789263

VL - 31

SP - 271

EP - 274

JO - IISE Transactions

JF - IISE Transactions

SN - 2472-5854

IS - 3

ER -