David Dureisseix

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
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(More)
  • 1