Universal hinge patterns for folding strips efficiently into any grid polyhedron

This publication has 8 references indexed in Scilit:

• Programmable Assembly With Universally Foldable Strings (Moteins)
  IEEE Transactions on Robotics, 2011
• Planning to fold multiple objects from a single self-folding sheet
  Robotica, 2011
• Programmable matter by folding
  Proceedings of the National Academy of Sciences, 2010
• Optimal Covering Tours with Turn Costs
  SIAM Journal on Computing, 2005
• Approximation algorithms for lawn mowing and milling☆☆A preliminary version of this paper was entitled “The lawnmower problem” and appears in the Proc. 5th Canad. Conf. Comput. Geom., Waterloo, Canada, 1993, pp. 461–466.
  Computational Geometry, 2000
• Folding flat silhouettes and wrapping polyhedral packages: New results in computational origami
  Computational Geometry, 2000
• The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs
  Journal of Algorithms, 1989
• Efficient bounds for the stable set, vertex cover and set packing problems
  Discrete Applied Mathematics, 1983