Skip to main content

Crazy Cuts: Dissecting Planar Shapes into Two Identical Parts

  • Conference paper
Mathematics of Surfaces XIII (Mathematics of Surfaces 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5654))

Included in the following conference series:

Abstract

We analyze a well known type of puzzle in planar geometry: given a planar shape, it is required to find a cut that divides the shape into two identical parts (up to rotation and translation). Clearly not all shapes can be so dissected and for some shapes that appear in puzzles the cutting curve is quite surprising and difficult to find. In this paper we first analyze the inverse problem of assembling planar shapes from two identical parts having partially ‘matching’ boundaries and then use the insights gained on this topic to derive an efficient algorithm to solve the dissection puzzle in quite general situations.

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

Access this chapter

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. Eriksson, K.: Splitting a polygon into two congruent pieces. The American Mathematical Monthly 103(5), 393–400 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  2. Rote, G.: Some thoughts about decomposition of a polygon into two congruent pieces (1997) (unpublished draft), http://page.mi.fu-berlin.de/rote/Papers/postscript/Decomposition+of+a++polytope+into+two+congruent+pieces.ps

  3. El-Khechen, D., Fevens, T., Iacono, J., Rote, G.: Partitioning a polygon into two congruent pieces. In: Kyoto International Conference on Computational Geometry and Graph Theory, KyotoCGGT2007, Kyoto, Japan, June 11-15 (2007)

    Google Scholar 

  4. El-Khechen, D., Fevens, T., Iacono, J., Rote, G.: Partitioning a polygon into two mirror congruent pieces. In: 20th Canadian Conference on Computational Geometry, CCCG 2008, Montréal, Québec, August 13-15 (2008)

    Google Scholar 

  5. Wolfson, H.J.: On curve matching. IEEE Transactions on PAMI 21(5), 483–489 (1990)

    Article  Google Scholar 

  6. Wolfson, H., Schonberg, E., Kalvin, A., Lamdan, Y.: Solving jigsaw puzzles using computer vision. Ann. Oper. Res. 12, 51–64 (1988)

    Article  MathSciNet  Google Scholar 

  7. Imiya, A., Kudo, S.: Docking of polygons using boundary descriptor. In: Petkov, N., Westenberg, M.A. (eds.) CAIP 2003. LNCS, vol. 2756, pp. 25–32. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  8. Bruckstein, A.M., Shaked, D.: On projective invariant smoothing and curve evolutions. Journal of Mathematical Imaging and Vision 7, 225–240 (1997)

    Article  MathSciNet  Google Scholar 

  9. Bruckstein, A.M., Shaked, D.: Skew symmetry detection via invariant signatures. Pattern Recognition 31(2), 181–192 (1998)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bruckstein, A.M., Shaked, D. (2009). Crazy Cuts: Dissecting Planar Shapes into Two Identical Parts. In: Hancock, E.R., Martin, R.R., Sabin, M.A. (eds) Mathematics of Surfaces XIII. Mathematics of Surfaces 2009. Lecture Notes in Computer Science, vol 5654. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03596-8_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03596-8_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03595-1

  • Online ISBN: 978-3-642-03596-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics