A PTAS for Cutting Out Polygons with Lines

  • Sergey Bereg
  • Ovidiu Daescu
  • Minghui Jiang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4112)

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Sergey Bereg
    • 1
  • Ovidiu Daescu
    • 1
  • Minghui Jiang
    • 2
  1. 1.Department of Computer ScienceUniversity of Texas at DallasRichardsonUSA
  2. 2.Department of Computer ScienceUtah State UniversityLoganUSA

Personalised recommendations