Paper by Erik D. Demaine
- Erik D. Demaine and Martin L. Demaine, “Planar Drawings of Origami Polyhedra”, Technical Report CS-98-17, Department of Computer Science, University of Waterloo, August 1998.
We present a new infinite class of polyhedra based on a class of origami bases
that we have developed. To understand these polyhedra and their underlying
bases, we examine drawings of their graphs. We present an elegant linear-time
algorithm to find a straight-line planar drawing. It displays a recursive
structure in the polyhedra that may lead to interesting fractals. We
introduce a “zoom” feature that allows one to interactively
explore the details of the graph while displaying this recursive structure.
- The paper is 13 pages.
- The paper is available in PostScript (607k).
- See information on file formats.
- [Google Scholar search]
- Related papers:
- GD98 (Planar Drawings of Origami Polyhedra)
See also other papers by Erik Demaine.
These pages are generated automagically from a
Last updated January 22, 2017 by