Universal hinge patterns for folding strips efficiently into any grid polyhedron
From MaRDI portal
Publication:5918984
DOI10.1016/j.comgeo.2020.101633zbMath1476.68273arXiv1611.03187OpenAlexW2949103311MaRDI QIDQ5918984
Martin L. Demaine, Anna Lubiw, Nadia Benbernou, Erik D. Demaine
Publication date: 23 October 2020
Published in: Lecture Notes in Computer Science, Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1611.03187
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25) Approximation algorithms (68W25)
Related Items
Folding polyominoes with holes into a cube, Folding Polyominoes into (Poly)Cubes, Folding polyiamonds into octahedra
Cites Work
- Efficient bounds for the stable set, vertex cover and set packing problems
- Folding flat silhouettes and wrapping polyhedral packages: New results in computational origami
- Approximation algorithms for lawn mowing and milling
- The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs
- Cauchy’s Theorem for Orthogonal Polyhedra of Genus 0
- Origamizer: A Practical Algorithm for Folding Any Polyhedron
- How to Tile by Dominoes the Boundary of a Polycube
- Optimal Covering Tours with Turn Costs