A disk-packing algorithm for an origami magic trick

Origami

Volumn , Issue , 2002, Pages 17-28

  Bern, Marshall ^a   Demaine, Erik ^b   Eppstein, David ^c   Hayes, Barry ^d  

^a PALO ALTO RESEARCH CENTER   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d NONE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85055933600     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Chapter

References (16)

1. M. Bern, S. Mitchell, and J. Ruppert. Linear-size nonobtuse triangulation of polygons. Disc. Comput. Geom. 14 (1995) 411-428.
2. M. Bern and D. Eppstein. Polynomial-size nonobtuse triangulation of polygons. Int. J. of Comp. Geom. and Applications 2 (1992) 241-255.
3. M. Bern and D. Eppstein. Quadrilateral meshing by circle packing. Proc. 6th Int. Meshing Roundtable, 1997, 7-19.
4. M. Bern and B. Hayes. The complexity of flat origami. Proc. 7th ACM-SIAM Symp. Disc. Algorithms, 1996, 175-183.
5. E. Demaine and M. Demaine. Computing extreme origami bases. Tech. Report CS-97-22, Dept. of Computer Science, U. of Waterloo, May 1997.
6. E. Demaine, M. Demaine, and A. Lubiw. Folding and cutting paper. Revised papers from the Japan Conference on Discrete and Computational Geometry, J. Akiyama, M. Kano, and M. Urabe, eds., Tokyo, 1998. Lecture Notes in Computer Science, Vol. 1763, Springer, 104-117.
7. E. Demaine, M. Demaine, and A. Lubiw. Folding and one straight cut suffice. Proc. 10th ACM-SIAM Symp. Disc. Algorithms, 1999, 891-892.
8. H. Edelsbrunner and T.-S. Tan. An upper bound for conforming Delaunay triangulations. Disc. Comput. Geom. 10 (1993) 197-213.
9. D. Eppstein. Faster circle packing with application to nonobtuse triangulation. Int. J. Comp. Geom. and Applications 7 (1997) 485-491.
10. M. Gardner. Paper Cutting. In New Mathematical Diversions, Math. Assoc. America, 1995, 58-69.
11. H. Houdini. In Paper Magic, E. P. Dutton & Company, 1922, 176-177.
12. T. Hull. On the mathematics of flat origamis. Congressus Numerantium 100 (1994) 215-224
13. R. Lang. A computational algorithm for origami design. Proc. 12th ACMSymp. Comp. Geometry, 1996, 98-105.
14. E. Lodi, L. Pagli, and N. Santoro, eds. Fun with Algorithms, Carleton Scientific, 1999.
15. National Standards and Emblems. Harper's New Monthly Magazine 47 (1873) 171-181.
16. J. Ruppert. A new and simple algorithm for quality 2-dimensional mesh generation. Proc. 4th ACM-SIAM Symp. Disc. Algorithms, 1993, 83-92.