Paper by Erik D. Demaine

Reference:

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.

BibTeX

@TechReport{DrawingExtremeTR,
  AUTHOR        = {Erik D. Demaine and Martin L. Demaine},
  TITLE         = {Planar Drawings of Origami Polyhedra},
  INSTITUTION   = {Department of Computer Science, University of Waterloo},
  INSTITUTIONURL = {http://www.cs.uwaterloo.ca/},
  NUMBER        = {CS-98-17},
  NUMBERURL     = {http://www.cs.uwaterloo.ca/cs-archive/CS-1998/CS-1998.shtml#17},
  MONTH         = {August},
  YEAR          = 1998,

  length        = {13 pages},
  papers        = {GD98},
  category      = {art},
}

Abstract:

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.

Length:

The paper is 13 pages.

Availability:

The paper is available in PostScript (607k).

See information on file formats.

[Google Scholar search]

Related papers:

GD98 (Planar Drawings of Origami Polyhedra)