Planar Drawings of Origami Polyhedra
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.
- 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.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.M. Bern and B. Hayes. The complexity of flat origami. In SODA, Atlanta, Jan. 1996, 175–183.Google Scholar