Skip to main content

Unfolding Orthogonal Polyhedra with Linear Refinement

  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 2015)

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

Included in the following conference series:


An unfolding of a polyhedron is a single connected planar piece without overlap resulting from cutting and flattening the surface of the polyhedron. Even for orthogonal polyhedra, it is known that edge-unfolding, i.e., cuts are performed only along the edges of a polyhedron, is not sufficient to guarantee a successful unfolding in general. However, if additional cuts parallel to polyhedron edges are allowed, it has been shown that every orthogonal polyhedron of genus zero admits a grid-unfolding with quadratic refinement. Using a new unfolding technique developed in this paper, we improve upon the previous result by showing that linear refinement suffices. Our approach not only requires fewer cuts but is also much simpler.

Y.-J. Chang—Supported by NSF grant CCF-1514383.

H.-C. Yen—Supported in part by Ministry of Science and Technology, Taiwan, under grant MOST 103-2221-E-002-154-MY3.

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

Access this chapter

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


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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  3. Demaine, E.D., O’Rourke, J.: Geometric Folding Algorithms: Linkages, Origami, Polyhedra. Cambridge University Press, Cambridge (2007)

    Book  MATH  Google Scholar 

  4. Dürer, A.: Unterweysung der Messung mit dem Zirkel und Richtscheyt, in Linien Ebnen und gantzen Corporen, 1525. Reprinted 2002, Verlag Alfons Uhl, Nördlingen; translated as the Painter’s Manual, Abaris Books, New York (1977)

    Google Scholar 

  5. O’Rourke, J.: Unfolding orthogonal polyhedra. In: Goodman, J.E., Pach, J., Pollack, R. (eds.) Surveys on Discrete and Computational Geometry: Twenty Years Later, pp. 231–255. American Mathematical Society, New York (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations


Corresponding author

Correspondence to Hsu-Chun Yen .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chang, YJ., Yen, HC. (2015). Unfolding Orthogonal Polyhedra with Linear Refinement. In: Elbassioni, K., Makino, K. (eds) Algorithms and Computation. ISAAC 2015. Lecture Notes in Computer Science(), vol 9472. Springer, Berlin, Heidelberg.

Download citation

  • DOI:

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-48970-3

  • Online ISBN: 978-3-662-48971-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics