Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 6876410
- Efficient folding algorithms for convex polyhedra
- Enumerating foldings and unfoldings between polygons and polytopes
- A method for designing crease patterns for flat-foldable origami with numerical optimization
- Flattening single-vertex origami: the non-expansive case
- Flattening single-vertex origami: The non-expansive case
- scientific article; zbMATH DE number 1629824
- Maximal origami flip graphs of flat-foldable vertices: properties and algorithms
- A survey of folding and unfolding in computational geometry
- Realization and connectivity of the graphs of origami flat foldings
Cites work
- Counting mountain-valley assignments for flat folds
- Discovery Science
- Generating bracelets in constant amortized time
- Geometric folding algorithms. Linkages, origami, polyhedra
- scientific article; zbMATH DE number 3783028 (Why is no real title available?)
- scientific article; zbMATH DE number 871913 (Why is no real title available?)
- Lexicographically least circular substrings
- Reverse search for enumeration
Cited in
(5)
This page was built for publication: Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2980895)