Chapter

Computing and Combinatorics

Volume 4112 of the series Lecture Notes in Computer Science pp 176-185

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

* 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 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.