Flipturning polygons

Discrete and Computational Geometry

Volumn 28, Issue 2, 2002, Pages 231-253

  Aichholzer, Oswin ^a   Cortés, Carmen ^b   Demaine, Erik D ^c   Dujmović, Vida ^d   Erickson, Jeff ^e   Meijer, Henk ^f   Overmars, Mark ^g   Palop, Belén ^h   Ramaswami, Suneeta ⁱ   Toussaint, Godfried T ^d  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^b UNIVERSITY OF SEVILLE   (Spain)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^d MCGILL UNIVERSITY   (Canada)

^e University of Illinois at Urbana Champaign   (United States)

^f QUEEN S UNIVERSITY   (Canada)

^g UTRECHT UNIVERSITY   (Netherlands)

^h UNIVERSITY OF ALCALÁ   (Spain)

ⁱ RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036025564     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00454-002-2775-7     Document Type: Article

References (22)

1. H.-K. Ahn, P. Bose, J. Czyzowicz, N. Hanusse, E. Kranakis, and P. Morin. Flipping your lid, Geombinatorics X(2):57-63, 2000 〈http://www.scs.carleton.ca/̃morin/publications/linkage/flipturn-tr.ps 〉.
2. O. Aichholzer, C. Cortés, E. D. Demaine, V. Dujmović, J. Erickson, H. Meijer, M. Overmars, B. Palop, S. Ramaswami, and G. T. Toussaint. Flipturning polygons. Technical Report UU-CS-2000-31, Department of Computer Science, Utrecht University, 2000. arXiv:cs.CG/0008010.
3. N. M. Amato, M. T. Goodrich, and E. A. Ramos. Linear-time polygon triangulation made easy via randomization. Proc. 16th Annu. ACM Sympos. Comput. Geom., pp. 201-212, 2000.
4. V. Bafna and P. A. Pevzner. Genome rearrangements and sorting by reversals. SIAM J. Comput. 25(2):272-289, 1996.
5. T. Biedl. Polygons needing many flipturns. Technical Report CS-2000-04, Department of Computer Science, University of Waterloo, January 2000 〈ftp://cs-archive.uwaterloo.ca/cs-archive/CS-2000-04/〉.
6. A. Caprara. Sorting permutations by reversals and Eulerian cycle decompositions. SIAM J. Discrete Math. 12(1):91-110. 1999.
7. B. Chazelle. Triangulating a simple polygon in linear time. Discrete Comput. Geom. 6(5):485-524, 1991.
8. L. E. Dubins, A. Orlitsky, J. A. Reeds, and L. A. Shepp. Self-avoiding random loops. IEEE Trans. Inform. Theory 34:1509-1516, 1988.
9. P. Erd̈os. Problem number 3763. Amer. Math. Monthly 42:627, 1935.
10. P. W. Finn, D. Halperin, L. E. Kavraki, J.-C. Latombe, R. Motwani, C. Shelton, and S. Venkatasubramanian. Geometric manipulation of flexible ligands. Applied Computational Geometry, pp. 67-78. Lecture Notes in Computer Science 1148, Springer-Verlag, Berlin, 1996.
11. M. D. Frank-Kamenetskii. Unravelling DNA. Addison-Wesley, Reading, MA, 1997.
12. B. Grünbaum. How to convexify a polygon. Geombinatorics V:24-30, 1995.
13. B. Grünbaum and J. Zaks. Convexification of polygons by flips and by flipturns. Discrete Math. 241(1-3):333-342, 2001.
14. N. Madras and G. Slade. The Self-Avoiding Walk. Birkhäuser, Boston, MA, 1993.
15. N. Madras and A. D. Sokal. The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk. J. Statist. Phys. 50:109-186, 1988.
16. F. M. McMillan. The Chain Straighteners. MacMillan Press, London, 1979.
17. J. O'Rourke. Folding and unfolding in computational geometry. Discrete and Computational Geometry (Proc. JCDCG '98), pp. 142-147. Lecture Notes in Computer Science 1763, Springer-Verlag, Berlin, 2000.
18. M. H. Overmars and J. van Leeuwen. Maintenance of configurations in the plane. J. Comput. System Sci. 23:166-204, 1981.
19. E. J. J. van Rensburg, S. G. Whittington, and N. Madras. The pivot algorithm and polygons: results on the FCC lattice. J. Phys. A 23:1589-1612, 1990.
20. B. de Sz.-Nagy. Solution of problem 3763. Amer. Math. Monthly 46:176-177, 1939.
21. G. T. Toussaint. Computational polygonal entanglement theory. Proc. VIII Encuentros de Geometría Computacional, pp. 269-278, 1999 〈http://www-cgrl.cs.mcgill.ca/̃godfried/publications/castellon.ps.gz 〉.
22. G. T. Toussaint. The Erdös-Nagy theorem and its ramifications. Proc. 11th Canadian Conf. Comput. Geom., pp. 9-12, 1999 〈http://www.cs.ubc.ca/conferences/CCCG/elec_proc/fpl9.ps.gz〉.