论文信息 - A Disk-Packing Algorithm for an Origami Magic Trick - 字舞流文

A Disk-Packing Algorithm for an Origami Magic Trick

We present an algorithm for a magic trick. Given a polygon with holesP , our algorithm determines a folding of a rectangular sheet of paper such that a single straight cut suffices to cut out P .

[1] David Eppstein,et al. Polynomial-size nonobtuse triangulation of polygons , 1991, SCG '91.

[2] Tiow Seng Tan,et al. An upper bound for conforming Delaunay triangulations , 1992, SCG '92.

[3] Jim Ruppert,et al. A new and simple algorithm for quality 2-dimensional mesh generation , 1993, SODA '93.

[4] Thomas C. Hull. On the Mathematics of Flat Origamis , 1994 .

[5] Marshall W. Bern,et al. Linear-size nonobtuse triangulation of polygons , 1994, SCG '94.

[6] Robert J. Lang,et al. A computational algorithm for origami design , 1996, SCG '96.

[7] Marshall W. Bern,et al. The complexity of flat origami , 1996, SODA '96.

[8] David Eppstein,et al. Faster Circle Packing with Application to Non-Obtuse Triangulation , 1997, Int. J. Comput. Geom. Appl..

[9] Erik D. Demaine,et al. Folding and one straight cut suffice , 1999, SODA '99.

[10] David Eppstein,et al. Quadrilateral Meshing by Circle Packing , 1999, Int. J. Comput. Geom. Appl..