Origamizer: a practical algorithm for folding any polyhedron
From MaRDI portal
Recommendations
Cited in
(17)- Bumpy pyramid folding
- Algorithms for designing pop-up cards
- Numerical approximation of rigid maps in origami theory
- Geodesic universal molecules
- Forming tile shapes with simple robots
- scientific article; zbMATH DE number 1507294 (Why is no real title available?)
- Folding flat silhouettes and wrapping polyhedral packages: New results in computational origami
- Foldabilizing furniture
- 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
- Lang's universal molecule algorithm
- A meshless method for the nonlinear von Kármán plate with multiple folds of complex shape. A bridge between cracks and folds
- Folding triangular and hexagonal mazes
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)
