Planar Drawings of Origami Polyhedra

  • Erik D. Demaine
  • Martin L. Demaine
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1547)


This work studies the structure of origami bases via graph drawings of origami polyhedra. In particular, we propose a new class of polyhedra, called extreme-base polyhedra, that capture the essence of “extreme” origami bases. We develop a linear-time algorithm to find the “natural” straight-line planar drawing of these polyhedra. This algorithm demonstrates a recursive structure in the polyhedra that was not apparent before, and leads to interesting fractals.


Hamiltonian Cycle Medial Axis Curve Edge Recursive Structure Graph Drawing 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    E. D. Demaine and M. L. Demaine. Planar drawings of origami polyhedra. Technical Report CS-98-17, University of Waterloo, August 1998.Google Scholar
  2. 2.
    E. G. Noik. A survey of presentation emphasis techniques for visualizing graphs. In Proc. Graphics Interface, Banff, Canada, May 1994, 225–233.Google Scholar
  3. 3.
    M. Bern and B. Hayes. The complexity of flat origami. In SODA, Atlanta, Jan. 1996, 175–183.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Erik D. Demaine
    • 1
  • Martin L. Demaine
    • 1
  1. 1.Dept. of Computer ScienceUniv. of WaterlooWaterlooCanada

Personalised recommendations