Origamizer: a practical algorithm for folding any polyhedron

DOI10.4230/LIPICS.SOCG.2017.34zbMATH Open1432.68509OpenAlexW2728062549MaRDI QIDQ4580109FDOQ4580109

Erik D. Demaine, Tomohiro Tachi

Publication date: 13 August 2018

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/7231/pdf/LIPIcs-SoCG-2017-34.pdf/

Recommendations

• Folding flat silhouettes and wrapping polyhedral packages: New results in computational origami
• scientific article; zbMATH DE number 1830752
• Origami embedding of piecewise-linear two-manifolds
• Origami, Linkages, and Polyhedra: Folding with Algorithms
• Folding Polyominoes into (Poly)Cubes

zbMATH Keywords

origamicomputational geometrypolyhedrafoldingVoronoi diagram

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Polyhedral manifolds (52B70)

Cited In (11)

• Universal hinge patterns for folding strips efficiently into any grid polyhedron
• Forming tile shapes with simple robots
• Title not available (Why is that?)
• Folding flat silhouettes and wrapping polyhedral packages: New results in computational origami
• The designs and deformations of rigidly and flat-foldable quadrilateral mesh origami
• Origami, Linkages, and Polyhedra: Folding with Algorithms
• Numerical Approximation of Orthogonal Maps
• Computational design methods for cylindrical and axisymmetric waterbomb tessellations
• Origami Embedding of Piecewise-Linear Two-Manifolds
• An Algorithm for Finding the Veech Group of an Origami
• A meshless method for the nonlinear von Kármán plate with multiple folds of complex shape. A bridge between cracks and folds

This page was built for publication: Origamizer: a practical algorithm for folding any polyhedron

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