Skip to main content

2 Result(s)

within Conference Paper Remove this filter Martin L. Demaine Remove this filter Algorithm Analysis and Problem Complexity Remove this filter Combinatorics Remove this filter Computer Graphics Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Folding and Cutting Paper

    We present an algorithm to find a flat folding of a piece of paper, so that one complete straight cut on the folding creates any desired plane graph of cuts. The folds are based on the straight skeleton, which...

    Erik D. Demaine, Martin L. Demaine, Anna Lubiw in Discrete and Computational Geometry (2000)

  2. Chapter and Conference Paper

    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...

    Erik D. Demaine, Martin L. Demaine in Graph Drawing (1998)

    Download PDF (127 KB)