Algorithmica

, Volume 53, Issue 2, pp 157–171

A PTAS for Cutting Out Polygons with Lines

Authors

  • Sergey Bereg
    • Department of Computer ScienceUniversity of Texas at Dallas
  • Ovidiu Daescu
    • Department of Computer ScienceUniversity of Texas at Dallas
    • Department of Computer ScienceUtah State University
Article

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

Abstract

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.

Keywords

Approximation algorithmsStock cutting

Copyright information

© Springer Science+Business Media, LLC 2008