Abstract
What is the largest cube or sphere that a given rectangular piece of paper can wrap? This natural problem, which has plagued gift-wrappers everywhere, remains very much unsolved. Here we introduce new upper and lower bounds and consolidate previous results. Though these bounds rarely match, our results significantly reduce the gap.
Eli Fox-Epstein: Supported in part by NSF Grant CCF-0964037.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Abbott, T.G., Abel, Z., Charlton, D., Demaine, E.D., Demaine, M.L., Kominers, S.: Hinged dissections exist. Discrete Comput. Geom. 47(1), 150–186 (2012)
Akiyama, J., Hirata, K., Kobayashi, M., Nakamura, G.: Convex developments of a regular tetrahedron. Comput. Geom. Theory Appl. 34(1), 2–10 (2006)
Akiyama, J., Ooya, T., Segawa, Y.: Wrapping a cube. Teach. Math. Appl. 16(3), 95–100 (1997)
Catalano-Johnson, M.L., Loeb, D., Beebee, J.: Problem 10716: A cubical gift. Am. Math. Monthly 108(1), 81–82 (2001)
Demaine, E.D., Demaine, M.L., Iacono, J., Langerman, S.: Wrapping spheres with flat paper. Comput. Geom. Theory Appl. 42(8), 748–757 (2009)
Demaine, E.D., Demaine, M.L., Mitchell, J.S.B.: Folding flat silhouettes and wrapping polyhedral packages: New results in computational origami. Comput. Geom. Theory Appl. 16(1), 3–21 (2000)
Demaine, E.D., O’Rourke, J.: Geometric Folding Algorithms: Linkages, Origami, Polyhedra, pp. 179–182. Cambridge University Press, New York (2007)
Fowler, P.W., Tarnai, T.: Transition from circle packing to covering on a sphere: the odd case of 13 circles. Proc. Royal Soc. London. Ser. A: Math. Phys. Eng. Sci. 455, 4131–4143 (1999)
Gardner, M.: New Mathematical Diversions, Chapter 5: Paper Cutting, pp. 58–69. Simon and Schuster, New York (1966)
Ozanam, J.: Récréations Mathématiques et Physiques, pp. 297–302. C.A. Jombert (1790)
Tarnai, T., Gáspár, Z.: Covering a sphere by equal circles, and the rigidity of its graph. Math. Proc. Camb. Philos. Soc. 110, 71–89, 7 (1991)
Acknowledgments
This research began in an open problem session and final project for MIT class 6.849: Geometric Folding Algorithms in Fall 2012. Thanks to Stephen Face for fruitful discussion and to Zachary Abel and Martin Demaine for their assistance with references.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Cole, A., Demaine, E.D., Fox-Epstein, E. (2014). On Wrapping Spheres and Cubes with Rectangular Paper. In: Akiyama, J., Ito, H., Sakai, T. (eds) Discrete and Computational Geometry and Graphs. JCDCGG 2013. Lecture Notes in Computer Science(), vol 8845. Springer, Cham. https://doi.org/10.1007/978-3-319-13287-7_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-13287-7_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-13286-0
Online ISBN: 978-3-319-13287-7
eBook Packages: Computer ScienceComputer Science (R0)