Skip to main content
SpringerLink
Log in

Unfolding some classes of orthogonal polyhedra of arbitrary genus

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

Unfolding polyhedra beyond genus zero (i.e., with holes) is challenging, yet it has not been investigated until very recently. We show two types of orthogonal polyhedra of arbitrary genus, namely, well-separated orthographs and regular orthogonal polyhedra with x- and z-holes, to enjoy \((2 \times 1)\)-grid-unfoldings, generalizing some prior works. In addition to the development of new unfolding techniques, for the first time we identify classes of nontrivial orthogonal polyhedra of arbitrary genus to admit grid-unfoldings subject to a small amount of refinements.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18

Similar content being viewed by others

References

  • Aloupis G, Bose PK, Collette S, Demaine ED, Demaine ML, Douïeb K, Dujmović V, Iacono J, Langerman S, Morin P (2011) Common unfoldings of polyominoes and polycubes. In: Akiyama J, Bo J, Kano M, Tan X (eds) Computational geometry, graphs and applications, LNCS 7033. Springer, Berlin, pp 44–54

    Chapter  Google Scholar 

  • Biedl T, Demaine E, Demaine M, Lubiw A, O’Rourke J, Overmars M, Robbins S, Whitesides S (1998) Unfolding some classes of orthogonal polyhedra. In: 10th Canadian conference of computational geometry, pp 70–71

  • Chang Y-J, Yen H-C (2017) Improved algorithm for grid-unfolding orthogonal polyhedra. Int J Comput Geom Appl 27(33):33–56

    Article  MathSciNet  MATH  Google Scholar 

  • Damian M, Flatland R, Meijer H, O’Rourke J (2005) Unfolding well-separated orthotrees. In: 15th Annual fall workshop on computational geometry, pp 23–35

  • Damian M, Flatland R, O’Rourke J (2007) Epsilon-unfolding orthogonal polyhedra. Graphs Combin 23(1):179–194

    Article  MathSciNet  MATH  Google Scholar 

  • Damian M, Flatland R, O’Rourke J (2008) Unfolding Manhattan towers. Comput Geom 40(2):102–114

    Article  MathSciNet  MATH  Google Scholar 

  • Damian M, Demaine ED, Flatland R (2014) Unfolding orthogonal polyhedra with quadratic refinement: the delta-unfolding algorithm. Graphs Combin 30(1):125–140

    Article  MathSciNet  MATH  Google Scholar 

  • Damian M, Demaine ED, Flatland R, O’Rourke J (2017) Unfolding genus-2 orthogonal polyhedra with linear refinement. Graphs Combin 33(5):1357–1379

    Article  MathSciNet  MATH  Google Scholar 

  • Demaine ED, O’Rourke J (2007) Geometric folding algorithms. Cambridge University Press, Cambridge

    Book  MATH  Google Scholar 

  • Dürer A (1525) Underweysung der Messung, mit dem Zirckel und Richtscheyt, in Linien, Ebenen unnd gantzen corporen. Nürnberg

  • Gupta S, Bourne D, Kim K, Krishnan S (1998) Automated process planning for sheet metal bending operations. J Manuf Syst 17:338–360

    Article  Google Scholar 

  • Liou M-H, Poon S-H, Wei Y-J (2014) On edge-unfolding one-layer lattice polyhedra with cubic holes. In: Computing and combinatorics—20th international conference, COCOON 2014, LNCS 8591, pp 251–262

  • O’Rourke J (2008) Unfolding orthogonal polyhedra. In: Goodman JE, Pach J, Pollack R (eds) Surveys on discrete and computational geometry: twenty years later. American Mathematical Society, Providence, RI, pp 231–255

  • Takahashi S, Wu H-Y, Saw SH, Lin C-C, Yen H-C (2011) Optimized topological surgery for unfolding 3D meshes. Comput Graph Forum 30(7):2077–2086

    Article  Google Scholar 

  • Wang C-H (1997) Manufacturability-driven decomposition of sheet metal products. Ph.D. thesis, Carnegie Mellon University, Pittsburgh, PA

Download references

Acknowledgements

The authors thank the anonymous referee for comments that improved the presentation of this paper.

Author information

Authors and Affiliations

  1. National Taiwan University, Taipei, Taiwan

    Kuan-Yi Ho & Hsu-Chun Yen

  2. University of Michigan, Ann Arbor, MI, USA

    Yi-Jun Chang

Authors
  1. Kuan-Yi Ho
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yi-Jun Chang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hsu-Chun Yen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hsu-Chun Yen.

Additional information

A preliminary version of this paper was presented at the 23rd International Computing and Combinatorics Conference (COCOON’17) during August 3–5, 2017, in Hong Kong, China

Research supported in part by MOST-106-2221-E-002-036-MY3.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ho, KY., Chang, YJ. & Yen, HC. Unfolding some classes of orthogonal polyhedra of arbitrary genus. J Comb Optim 37, 482–500 (2019). https://doi.org/10.1007/s10878-018-0299-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-018-0299-1

Keywords

Search

Navigation