Robert J. Lang
- 1.John Montroll and Robert J. Lang, Origami Sea Life, Dover, 1990.Google Scholar
- 2.John Montroll, Origami for the Enthusiast, Dover, 1979.Google Scholar
- 3.Robert J. Lang, Origami Insects, Dover, 1995.Google Scholar
- 4.Fumiaki Kawahata, Fantasy Origami, Gallery Origami House (Tokyo), 1995.Google Scholar
- 5.John Montroll, Prehistoric Origami, Dover Publications, 1989.Google Scholar
- 6.Kunihiko Kasahara, Creative Origami, Japan Publications, 1967.Google Scholar
- 7.Kunihiko Kasahara and Toshie Takahama, Origami for the Connoisseur, Japan Publications, 1987.Google Scholar
- 8.Kunihiko Kasahara, Origami Omnibus, Japan Publications, 1988.Google Scholar
- 9.Peter Engel, Origami from Angelfish to Zen, Dover, 1994.Google Scholar
- 10.Toshiyuki Meguro, private comm.Google Scholar
- 11.Jun Maekawa, in Oru, vol. 2, no. 2, 1994.Google Scholar
- 12.Fumiaki Kawahata, "The technique to fold free angles of formative art 'origami'," abstract in proceedings of The Second International Meeting on Origami Science and Scientific Origami, Otsu, Japan, 1994.Google Scholar
- 13.Toshikazu Kawasaki, "On the relation between mountaincreases and valley-creases of a fiat origami," in Origami Science and Technology, H. Huzita, ed., 1989, p. 229-237.Google Scholar
- 14.Robert J. Lang, "Mathematical algorithms for origami design," Symmetry: Culture and Science, vol. 5, no. 2, pp. 115-152, 1994.Google Scholar
- 15.Tom Hull, "On the mathematics of flat origamis," Congressus Numerantium 100, (1994), pp. 215-224.Google Scholar
- 16.D.A. Huffman, Curvatures and creases: a primer on paper, IEEE Trans. on Computers, Volume C-25, (1976), pp. 1010-1019.Google Scholar
- 17.Marshall Bern and Barry Hayes, "On the Complexity of Flat Origami," ACM Symposium on Discrete Algorithms, 1996. Google ScholarDigital Library
- 18.G.N. Vanderplaats, Numerical Optimization Techniques for Engineering Design, McGraw-Hill, 1984Google Scholar
- 19.William H. Press, Brian P. Flannery, Saul A. Teukolsky, and William T. Vetterling, Numerical Recipes in C, 2nd Ed., Cambridge, 1994.Google Scholar
- 20.The program TreeMaker runs on Macintosh computers and is available with documentation via anonymous ftp at rugcis.rug, nl in directory origami/programs.Google Scholar
- 21.Martin Gardner, "Tangent Circles," Fractal Music and Hypercards, W. H. Freeman, 1992, pp. 149-166, and references therein.Google Scholar
Index Terms
- A computational algorithm for origami design
Recommendations
Logical and algebraic view of Huzita's origami axioms with applications to computational origami
SAC '07: Proceedings of the 2007 ACM symposium on Applied computingWe describe Huzita's origami axioms from the logical and algebraic points of view. Observing that Huzita's axioms are statements about the existence of certain origami constructions, we can generate basic origami constructions from those axioms. Origami ...
Legalization algorithm for multiple-row height standard cell design
DAC '16: Proceedings of the 53rd Annual Design Automation ConferenceTypical standard cell placement algorithms assume that all cells are of the same height such that cells can be aligned along the placement rows. However, modern standard cell designs are getting more complicated and multiple-row height cell becomes more ...
A routing algorithm for flip-chip design
ICCAD '05: Proceedings of the 2005 IEEE/ACM International conference on Computer-aided designThe flip-chip package gives the highest chip density of any packaging method to support the pad-limited Application-Specific Integrated Circuit (ASIC) designs. In this paper, we propose the first router for the flip-chip package in the literature. The ...
Comments