Flipturning Polygons
暂无分享,去创建一个
Erik D. Demaine | Godfried T. Toussaint | Mark H. Overmars | Vida Dujmovic | Jeff Erickson | Henk Meijer | Oswin Aichholzer | Carmen Cortés | Suneeta Ramaswami | Belén Palop
[1] A. Sokal,et al. The pivot algorithm: A highly efficient Monte Carlo method for the self-avoiding walk , 1988 .
[2] Godfried T. Toussaint. The Erdös-Nagy theorem and its ramifications , 1999, CCCG.
[3] G. Toussaint. Computational Polygonal Entanglement Theory , 1999 .
[4] Frank M. McMillan,et al. The Chain Straighteners , 1979 .
[5] Robert E. Tarjan,et al. Self-adjusting binary search trees , 1985, JACM.
[6] E. Demaine,et al. Folding and unfolding , 2002 .
[7] N. Madras,et al. THE SELF-AVOIDING WALK , 2006 .
[8] Alon Orlitsky,et al. Self-avoiding random loops , 1988, IEEE Trans. Inf. Theory.
[9] S. Whittington,et al. The pivot algorithm and polygons: results on the FCC lattice , 1990 .
[10] Alberto Caprara,et al. Sorting Permutations by Reversals and Eulerian Cycle Decompositions , 1999, SIAM J. Discret. Math..
[11] Prosenjit Bose,et al. Flipping your Lid , 2000, CCCG.
[12] G. Toussaint. The Erd} Os-nagy Theorem and Its Ramiications , 1999 .
[13] Joseph O'Rourke,et al. Folding and Unfolding in Computational Geometry , 1998, JCDCG.
[14] Paul Erdös,et al. Problems for Solution: 3758-3763 , 1935 .
[15] Vineet Bafna,et al. Genome Rearrangements and Sorting by Reversals , 1996, SIAM J. Comput..
[16] Nancy M. Amato,et al. Linear-time triangulation of a simple polygon made easier via randomization , 2000, SCG '00.
[17] Branko Grünbaum,et al. Convexification of polygons by flips and by flipturns , 2001, Discret. Math..
[18] Jan van Leeuwen,et al. Maintenance of Configurations in the Plane , 1981, J. Comput. Syst. Sci..
[19] Bernard Chazelle. Triangulating a simple polygon in linear time , 1991, Discret. Comput. Geom..