Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns

DOI10.1007/978-3-319-53925-6_2zbMath1487.51012OpenAlexW3071682684WikidataQ60691768 ScholiaQ60691768MaRDI QIDQ2980895

Koji Ouchi, Ryuhei Uehara

Publication date: 5 May 2017

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-53925-6_2

zbMATH Keywords

origamienumerationflat-foldable crease patterns

Mathematics Subject Classification ID

Geometric constructions in real or complex geometry (51M15)

Related Items (1)

Counting locally flat-foldable origami configurations via 3-coloring graphs

Uses Software

• OEIS

Cites Work

• Lexicographically least circular substrings
• Reverse search for enumeration
• Generating Bracelets in Constant Amortized Time
• Counting mountain-valley assignments for flat folds
• Discovery Science
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns