How complex is origami design?
Résumé
The latest decade saw the emergence of a new approach to the ancient paperfolding art: the computational origami.Several complex planar geometry problems have been studied from their complexity and design efficiency point of view, such as the color changing. The checkered patterns are amonst the most challenging problems, especially when constrained by searching the most efficient design, i.e. with the less waste of paper.We propose herein the illustration of complexity on a pixel-matrix origami design, a complication of the chessboard: each board square should be able to change its color independently, using as many flapping mechanisms as necessary, but still using a single square sheet of paper with a minimal waste.
Origine : Fichiers produits par l'(les) auteur(s)
