Article

Algorithmica

, Volume 53, Issue 2, pp 157-171

First online:

A PTAS for Cutting Out Polygons with Lines

  • Sergey BeregAffiliated withDepartment of Computer Science, University of Texas at Dallas
  • , Ovidiu DaescuAffiliated withDepartment of Computer Science, University of Texas at Dallas
  • , Minghui JiangAffiliated withDepartment of Computer Science, Utah State University Email author 

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Abstract

We present a simple O(m+n 6/ε 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 algorithms Stock cutting