A PTAS for Cutting Out Polygons with Lines
- Cite this paper as:
- Bereg S., Daescu O., Jiang M. (2006) A PTAS for Cutting Out Polygons with Lines. In: Chen D.Z., Lee D.T. (eds) Computing and Combinatorics. COCOON 2006. Lecture Notes in Computer Science, vol 4112. Springer, Berlin, Heidelberg
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.
Unable to display preview. Download preview PDF.