, Volume 53, Issue 2, pp 157-171
Date: 29 Mar 2008

A PTAS for Cutting Out Polygons with Lines

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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.