Skip to main content

Dudeney Dissection of Polygons

  • Conference paper
Discrete and Computational Geometry (JCDCG 1998)

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

Included in the following conference series:

Abstract

Given an equilateral triangle A and A Square B of the same area, Henry E. Dudeney introduced A partition of A into parts that tan be reassembled in some way, without turning over the surfaces, to form B. An examination of Dudeney’s method of partition motivates us to introduce the notion of Dudeney dissections of various polygons to other polygons.

Let A and B be polygons with the same area. A Dudeney dissection of A to B is a partition of A into parts which tan be reassembled to produce B as follows: Hinge the parts of A like a chain along the perimeter of A, then reassemble them to form B with the perimeter of A is in its interior, without turning the surfaces over. Using tilings of the plane, we produce Dudeney dissections of quadrilaterals to other quadrilaterals, quadrilaterals to parallelograms, triangles to parallelograms, parallelhexagons to trapezoids, parallelhexagons to triangles, and trapezoidal pentagons to trapezoids.

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. Dudeney, H.E.: The Canterbury Puzzles, Dover (1958)

    Google Scholar 

  2. Lindgren, H.: Recreational Problems in Geometric Dissections & How to Solve Them, Dover (1972)

    Google Scholar 

  3. Frederickson, G.N.: Dissections: Plane & Fancy. Cambridge University Press, Cambridge (1997)

    MATH  Google Scholar 

  4. Akiyama, J., Nakamura, G.: Dudeney Dissections of polyhedrons (in preparation)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Akiyama, J., Nakamura, G. (2000). Dudeney Dissection of Polygons. In: Akiyama, J., Kano, M., Urabe, M. (eds) Discrete and Computational Geometry. JCDCG 1998. Lecture Notes in Computer Science, vol 1763. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-46515-7_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-46515-7_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67181-7

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics