A PTAS for Cutting Out Polygons with Lines

We present a simple O(m+n6 / 12 ) time (1+ )-approximation algorithm for the problem of cutting a convex n-gon out of a convex m-gon with line cuts of minimum total cutting length. This problem was introduced by Overmars and Welzl in the First Annual ACM Symposium on Computational Geometry in 1985. We also present a constant approximation algorithm for the generalized problem of cutting two disjoint convex polygons out of a convex polygon.

• Type: Conference
• Year: 2006
• Where: COCOON
• Authors: Sergey Bereg, Ovidiu Daescu, Minghui Jiang
• Keywords: COCOON 2006, Combinatorics, Convex M-gon, Convex Polygon, Disjoint Convex Polygons