Flat folding an unassigned single-vertex complex (Combinatorially Embedded Planar Graph with Specified Edge Lengths) without flat angles

DOI10.4230/LIPICS.SOCG.2022.29MaRDI QIDQ6539542

Erik D. Demaine, Dylan Hendrickson, Victor Luo, Author name not available (Why is that?)

Publication date: 14 May 2024

origami algorithms graph drawing folding polyhedral complex

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

This page was built for publication: Flat folding an unassigned single-vertex complex (Combinatorially Embedded Planar Graph with Specified Edge Lengths) without flat angles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6539542)