Computing Origami Universal Molecules with Cyclic Tournament Forests

@article{Bowers2013ComputingOU,
  title={Computing Origami Universal Molecules with Cyclic Tournament Forests},
  author={John Christopher Bowers and Ileana Streinu},
  journal={2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing},
  year={2013},
  pages={42-49}
}
Lang's "universal molecule" algorithm solves a variant of the origami design problem. It takes as input a metric tree and a convex polygonal region (the "paper") having a certain metric relationship with the tree. It computes a crease- pattern which allows for the paper to "fold" to a uniaxial base, which is a 3-dimensional shape projecting onto the given tree. Lang's universal molecule algorithm runs in cubic time and quadratic space. We investigate two implementations which improve the… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-2 OF 2 CITATIONS

Skeleton Structures and Origami Design

VIEW 4 EXCERPTS
CITES METHODS & BACKGROUND

Lang’s Universal molecule algorithm

  • Annals of Mathematics and Artificial Intelligence
  • 2014
VIEW 2 EXCERPTS
CITES METHODS

References

Publications referenced by this paper.