Skip to main content

Packing Cube Nets into Rectangles with O(1) Holes

  • Conference paper
  • First Online:
Book cover Discrete and Computational Geometry, Graphs, and Games (JCDCGGG 2018)

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

  • 260 Accesses

Abstract

We show that the 11 hexomino nets of the unit cube (using arbitrarily many copies of each) can pack disjointly into an \(m \times n\) rectangle and cover all but a constant c number of unit squares, where \(4 \le c \le 14\) for all integers \(m, n \ge 2\). On the other hand, the nets of the dicube (two unit cubes) can be exactly packed into some rectangles.

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 44.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.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

Notes

  1. 1.

    An n-omino or polyomino is an edge-to-edge joining of n unit squares. The special cases \(n=1,2,3,4,5,6\) are called monominoes, dominoes, trominoes, tetrominoes, pentominoes, and hexominoes, respectively.

References

  1. Abel, Z., et al.: Unfolding and dissection of multiple cubes, tetrahedra, and doubly covered squares. J. Inf. Process. 25, 610–615 (2017)

    Google Scholar 

  2. Bos, M.: Tiling squares with two different hexominoes. Cubism Fun 70, 4–7 (2007)

    Google Scholar 

  3. Clarke, A.L.: The poly pages: polyominoes: hexominoes, July 2005. http://www.recmath.com/PolyPages/PolyPages/index.htm?Polyominoes.html#hexominoes

  4. Dahlke, K.A.: The \(Y\)-hexomino has order 92. J. Combin. Theory Ser. A 51(1), 125–126 (1989)

    Article  MathSciNet  Google Scholar 

  5. Dahlke, K.A.: Tiling rectangles with polyominoes, November 2017. http://www.eklhad.net/polyomino/index.html

  6. Friedman, E.: Polyominoes in rectangles, April 2017. https://www2.stetson.edu/~efriedma/order/

  7. Gardner, M.: Polyominoes. In: Hexaflexagons and Other Mathematical Diversions: The First Scientific American Book of Mathematical Puzzles and Games, chap. 13, pp. 124–140. University of Chicago Press (1988). Originally published by Simon & Schuster, 1959, and since republished by MAA/Cambridge, 2008

    Google Scholar 

  8. Gardner, M.: Polyominoes and rectification. In: Mathematical Magic Show, chap. 13, pp. 172–187 and 289–292. Mathematical Association of America (1990). Originally published by Knopf, 1977

    Google Scholar 

  9. Golomb, S.W.: Checker boards and polyominoes. Am. Math. Mon. 61(10), 675–682 (1954)

    Article  MathSciNet  Google Scholar 

  10. Golomb, S.W.: Tiling with polyominoes. J. Combin. Theory 1(2), 280–296 (1966)

    Article  MathSciNet  Google Scholar 

  11. Golomb, S.W.: Polyominoes: Puzzles, Patterns, Problems, and Packings. 2nd edn. Princeton University Press (1994)

    Google Scholar 

  12. Inoha, T., Inoue, Y., Ozawa, T., Uno, Y.: Packing developments of cubes. In: Abstracts from the 20th Japan Conference on Discrete and Computational Geometry, Graphs, and Games (2017)

    Google Scholar 

  13. Inoha, T., Inoue, Y., Ozawa, T., Uno, Y.: Packing developments of cubes: a proof of the theorem. Manuscript (2017)

    Google Scholar 

  14. Klarner, D.A.: Packing a rectangle with congruent \(N\)-ominoes. J. Combin. Theory 7(2), 107–115 (1969)

    Article  MathSciNet  Google Scholar 

  15. Odawara, M.: Development of a cube (in Japanese), September 2008. http://www.torito.jp/puzzles/hako047.shtml

  16. Pegg Jr., E..: The eternity puzzle, May 2002. http://www.mathpuzzle.com/eternity.html

  17. Putter, G.: Gerard’s universal polyomino solver, February 2012. https://gp.home.xs4all.nl/PolyominoSolver/Polyomino.html

  18. Reid, M.: Rectifiable polyomino page, October 2005. http://www.cflmath.com/Polyomino/rectifiable.html

  19. Röver, A.: Burrtools, October 2018. http://burrtools.sourceforge.net/

  20. Selby, A.: Eternity page, May 2006. http://www.archduke.org/eternity/

  21. Sicherman, G.: Hexomino oddities, September 2017. https://userpages.monmouth.com/~colonel/6ominodd/index.html

Download references

Acknowledgments

This research is partially supported by JSPS KAKENHI Grant Numbers JP17K00017, JP21K11757, JP20H05964, JP17H06287, JP18H04091, and JST CREST Grant Number JPMJCR1402.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yushi Uno .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Demaine, E.D., Demaine, M.L., Uehara, R., Uno, Y., Winslow, A. (2021). Packing Cube Nets into Rectangles with O(1) Holes. In: Akiyama, J., Marcelo, R.M., Ruiz, MJ.P., Uno, Y. (eds) Discrete and Computational Geometry, Graphs, and Games. JCDCGGG 2018. Lecture Notes in Computer Science(), vol 13034. Springer, Cham. https://doi.org/10.1007/978-3-030-90048-9_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-90048-9_12

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-90047-2

  • Online ISBN: 978-3-030-90048-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics