An example of geometric origami design with benefit of graph enumeration algorithms

David Dureisseix 1, 2
1 SMC - Systèmes Mécaniques et Contacts
LaMCoS - Laboratoire de Mécanique des Contacts et des Structures [Villeurbanne]
2 TMI - Tribologie et Mécanique des Interfaces
LaMCoS - Laboratoire de Mécanique des Contacts et des Structures [Villeurbanne]
Abstract : This article is concerned with an example of complex planar geometry arising from flat origami challenges. The complexity of solution algorithms is illustrated, depending on the depth of the initial analysis of the problem, starting from brute force enumeration, up to the equivalence to a dedicated problem in graph theory. This leads to algorithms starting from an untractable case on modern computers, up to a run of few seconds on a portable personal computer. This emphasizes the need for a prior analysis by humans before considering the assistance of computers for complex design problems. The graph problem is an enumeration of spanning trees from a grid graph, leading to a coarse scale description of the topology of the paper edge on the flat-folded state.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [38 references]  Display  Hide  Download


https://hal.archives-ouvertes.fr/hal-01219814
Contributor : David Dureisseix <>
Submitted on : Wednesday, May 24, 2017 - 7:06:23 PM
Last modification on : Wednesday, November 20, 2019 - 7:47:26 AM

Files

papv4.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution - NonCommercial - ShareAlike 4.0 International License

Identifiers

  • HAL Id : hal-01219814, version 4
  • ARXIV : 1510.07499

Collections

Citation

David Dureisseix. An example of geometric origami design with benefit of graph enumeration algorithms. 2016. ⟨hal-01219814v4⟩

Share

Metrics

Record views

790

Files downloads

817