Planar Drawings of Origami Polyhedra

Demaine, Erik D. and Demaine, Martin L. (1998) Planar Drawings of Origami Polyhedra. In: Graph Drawing 6th International Symposium, GD’ 98, August 13-15, 1998 , pp. 438-440(Official URL: http://dx.doi.org/10.1007/3-540-37623-2_36).

Full text not available from this repository.

Abstract

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.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-37623-2_36
Classifications: M Methods > M.999 Others
P Styles > P.720 Straight-line
G Algorithms and Complexity > G.999 Others
URI: http://gdea.informatik.uni-koeln.de/id/eprint/286

Actions (login required)

View Item View Item