Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Cutting a Country for Smallest Square Fit

  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2518))

Included in the following conference series:

Abstract

We study the problem of cutting a simple polygon with n vertices into two pieces such that — if we reposition one piece disjoint of the other, without rotation — they have the minimum possible bounding square. If we cut with a single horizontal or vertical segment, then we can compute an optimal solution for a convex polygon with n vertices in O(n) time. For simple polygons we give an O(n 4ga(n) log n) time algorithm.

Supported by the Berlin-Zürich Graduate Program “Combinatorics, Geometry, and Computation”, financed by the German Science Foundation (DFG) and ETH Zürich.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. Alt and F. Hurtado. Packing convex polygons into rectangular boxes. In Discrete and Computational Geometry — Japanese Conference, JCDCG 2000, number 2098 in Lect. Notes in Comp. Science, pages 67–80. Springer, 2001.

    Google Scholar 

  2. K. Daniels and V. J. Milenkovic. Multiple translational containment, part i: An approximate algorithm. Algorithmica, 19(1–2):148–182, September 1997.

    Google Scholar 

  3. Greg Frederickson. Dissections: Plane and Fancy. Cambridge University Press, 1997.

    Google Scholar 

  4. J. Hershberger. Finding the upper envelope of n line segments in O(n log n) time. Inform. Process. Lett., 33:169–174, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  5. Michael Hoffmann. Covering polygons with few rectangles. In Abstracts 17th European Workshop Comput. Geom., pages 39–42. Freie Universität Berlin, 2001.

    Google Scholar 

  6. V. Milenkovic. Translational polygon containment and minimal enclosure using linear programming based restriction. In Proc. 28th Annu. ACM Sympos. Theory Comput., pages 109–118, 1996.

    Google Scholar 

  7. Victor J. Milenkovic. Multiple translational containment, part ii: Exact algorithm. Algorithmica, 19(1–2):183–218, September 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Information and Computing Sciences, Utrecht University, The Netherlands

    Marc van Kreveld

  2. Institute for Theoretical Computer Science, ETH Zürich, Switzerland

    Bettina Speckmann

Authors
  1. Marc van Kreveld
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bettina Speckmann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, Ontario, Canada, K1S 5B6

    Prosenjit Bose  & Pat Morin  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

van Kreveld, M., Speckmann, B. (2002). Cutting a Country for Smallest Square Fit. In: Bose, P., Morin, P. (eds) Algorithms and Computation. ISAAC 2002. Lecture Notes in Computer Science, vol 2518. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36136-7_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-36136-7_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00142-3

  • Online ISBN: 978-3-540-36136-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation