Skip to main content
SpringerLink
Log in

A PTAS for Cutting Out Polygons with Lines

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bhadury, J., Chandrasekaran, R.: Stock cutting to minimize cutting length. Eur. J. Oper. Res. 88, 69–87 (1996)

    Article  MATH  Google Scholar 

  2. Chandrasekaran, R., Daescu, O., Luo, J.: Cutting out polygons. In: Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG’05), pp. 183–186 (2005)

  3. Daescu, O., Luo, J.: Cutting out polygons with lines and rays. Int. J. Comput. Geom. Appl. 16, 227–248 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  4. Demaine, E.D., Demaine, M.L., Kaplan, C.S.: Polygons cuttable by a circular saw. Comput. Geom. Theory Appl. 20, 69–84 (2001)

    MATH  MathSciNet  Google Scholar 

  5. Dumitrescu, A.: An approximation algorithm for cutting out convex polygons. Comput. Geom. Theory Appl. 29, 223–231 (2004)

    MATH  MathSciNet  Google Scholar 

  6. Dumitrescu, A.: The cost of cutting out convex n-gons. Discrete Appl. Math. 143, 353–358 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  7. Overmars, M.H., Welzl, E.: The complexity of cutting paper. In: Proceedings of the 1st Annual ACM Symposium on Computational Geometry (SoCG’85), pp. 316–321 (1985)

  8. Tan, X.: Approximation algorithms for cutting out polygons with lines and rays. In: Proceedings of the 11th International Computing and Combinatorics Conference (COCOON’05), LNCS 3595, pp. 534–543 (2005)

  9. Zwillinger, D.: CRC Standard Mathematical Tables and Formulae, 31st edn. CRC Press, Boca Raton (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Texas at Dallas, Richardson, TX, 75083-0688, USA

    Sergey Bereg & Ovidiu Daescu

  2. Department of Computer Science, Utah State University, Logan, UT, 84322-4205, USA

    Minghui Jiang

Authors
  1. Sergey Bereg
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ovidiu Daescu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Minghui Jiang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Minghui Jiang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bereg, S., Daescu, O. & Jiang, M. A PTAS for Cutting Out Polygons with Lines. Algorithmica 53, 157–171 (2009). https://doi.org/10.1007/s00453-008-9182-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-008-9182-2

Keywords

Search

Navigation