, Volume 53, Issue 2, pp 157–171

A PTAS for Cutting Out Polygons with Lines


DOI: 10.1007/s00453-008-9182-2

Cite this article as:
Bereg, S., Daescu, O. & Jiang, M. Algorithmica (2009) 53: 157. doi:10.1007/s00453-008-9182-2


We present a simple O(m+n6/ε12) time (1+ε)-approximation algorithm for finding a minimum-cost sequence of lines to cut a convex n-gon out of a convex m-gon.


Approximation algorithmsStock cutting

Copyright information

© Springer Science+Business Media, LLC 2008

Authors and Affiliations

  1. 1.Department of Computer ScienceUniversity of Texas at DallasRichardsonUSA
  2. 2.Department of Computer ScienceUtah State UniversityLoganUSA