Skip to main content

1 Result(s)

within Computer Science Remove this filter Algorithm Analysis and Problem Complexity Remove this filter Discrete Mathematics in Computer Science Remove this filter Martin L. Demaine Remove this filter Conference Paper Remove this filter

and
Your search also matched 19 preview-only Content is preview-only when you or your institution have not yet subscribed to it.

By making our abstracts and previews universally accessible we help you purchase only the content that is relevant to you. results, e.g.

Universal Hinge Patterns for Folding Strips Efficiently into Any Grid Polyhedron

Include preview-only content

  1. Chapter and Conference Paper

    Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths

    When can a plane graph with prescribed edge lengths and prescribed angles (from among {0,180°, 360°}) be folded flat to lie in an infinitesimally thick line, without crossings? This problem generalizes the cla...

    Zachary Abel, Erik D. Demaine, Martin L. Demaine, David Eppstein… in Graph Drawing (2014)

    Download PDF (400 KB)