The Erdös-Nagy theorem and its ramifications

Computational Geometry: Theory and Applications

Volumn 31, Issue 3, 2005, Pages 219-236

  Toussaint, Godfried ^a  

^a MCGILL UNIVERSITY   (Canada)

Author keywords

Computational geometry; Convexification; Curve inflation; Flips; Flipturns; Knot theory; Molecular reconfiguration; Pivots; Polygonal linkages; Polygons; Polymer physics; Robotics; Self avoiding walks

Indexed keywords

EID: 84867967318     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2004.12.005     Document Type: Article

References (53)

1. M. Abellanas, F. Hurtado, and P. Ramos Tolerance of geometric structures Proc. 6th Canadian Conference on Computational Geometry 1994 250 255
2. H.-K. Ahn, P. Bose, J. Czyzowicz, N. Hanusse, E. Kranakis, and P. Morin Flipping your lid Geombinatorics 10 2 2000 57 63
3. 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 Discrete Comput. Geom. 28 2002 231 253
4. O. Aichholzer, E.D. Demaine, J. Erickson, F. Hurtado, M. Overmars, M. Soss, and G.T. Toussaint Reconfiguring convex polygons Computational Geometry 20 2001 85 95
5. G. Aloupis, G. Ewald, and G.T. Toussaint More classes of stuck unknotted hexagons Contributions to Algebra and Geometry 45 2 2004 429 434
6. T. Biedl, E. Demaine, M. Demaine, S. Lazard, A. Lubiw, J. O'Rourke, M. Overmars, S. Robbins, I. Streinu, G.T. Toussaint, and S. Whitesides Locked and unlocked polygonal chains in three dimensions Discrete Computat. Geom. 26 3 2001 269 281
7. T.C. Biedl, Polygons needing many flipturns, Technical Report CS-2000-04, Department of Computer Science, University of Waterloo, 2000
8. R.H. Bing, and N.D. Kazarinoff On the finiteness of the number of reflections that change a nonconvex plane polygon into a convex one Matematicheskoe Prosveshchenie 6 1961 205 207 In Russian
9. J. Cantarella, and H. Johnston Nontrivial embeddings of polygonal intervals and unknots in 3-space J. Knot Theory Ramifications 7 8 1998 1027 1039
10. G. Choquet Variétés et corps convexes Association Française pour l'Avancement des Sciences, Congrès de la Victoire-1945 1945 91 93
11. R. Connelly, E.D. Demaine, and G. Rote Every polygon can be untangled Proc. 16th European Workshop on Computational Geometry, Eliat, Israel 2000
12. B. de Sz.-Nagy Solution of problem 3763 Amer. Math. Monthly 46 1939 176 177
13. L.E. Dubins, A. Orlitsky, J.A. Reeds, and L.A. Shepp Self-avoiding random loops IEEE Trans. Inform. Theory 34 1988 1509 1516
14. P. Erds Problem number 3763 Amer. Math. Monthly 42 1935 627
15. T. Fevens, A. Hernández, A. Mesa, P. Morin, M. Soss, and G.T. Toussaint Simple polygons with an infinite sequence of deflations Contributions to Algebra and Geometry 42 2 2001 307 311
16. 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 1996 Springer Berlin 67 78
17. M.D. Frank-Kamenetskii Unravelling DNA 1997 Addison-Wesley Reading, MA
18. B. Grünbaum Polygons Lecture Notes in Mathematics 1975 Springer Berlin 147 184
19. B. Grünbaum How to convexify a polygon Geombinatorics 5 1995 24 30
20. B. Grünbaum, and J. Zaks Convexification of polygons by flips and by flipturns Discrete Math. 241 2001 333 342
21. T. Kaluza Problem 2: Konvexieren von Polygonen Math. Semesterber. 28 1981 153 154
22. M. Kapovich, and J.J. Millson The symplectic geometry of polygons in euclidean space J. Differential Geom. 44 1996 479 513
23. N.D. Kazarinoff Analytic Inequalities 1961 Holt, Rinehart and Winston
24. N.D. Kazarinoff, and R.H. Bing A finite number of reflections render a nonconvex plane polygon convex Notices Amer. Math. Soc. 6 1959 834
25. W.J. Lenhart, and S.H. Whitesides Reconfiguring closed polygonal chains in euclidean d-space Discrete Comput. Geom. 13 1995 123 140
26. N. Madras, A. Orlitsky, and L.A. Shepp Monte Carlo generation of self-avoiding walks with fixed endpoints and fixed length J. Statist. Phys. 58 1990 159 183
27. N. Madras, and G. Slade The Self-Avoiding Walk 1993 Birkhäuser Boston
28. N. Madras, and A.D. Sokal The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk J. Statist. Phys. 50 1988 109 186
29. D. McCallum, and D. Avis A linear algorithm for finding the convex hull of a simple polygon Inform. Process. Lett. 9 1979 201 206
30. F.M. McMillan The Chain Straighteners 1979 MacMillan Press
31. A. Melkman On-line construction of the convex hull of a simple polyline Inform. Process. Lett. 25 1987 11 12
32. K. Millett Knotting of regular polygons in 3-space J. Knot Theory Ramifications 3 1994 263 278
33. J. O'Rourke Computational Geometry in C second ed. 1998 Cambridge University Press Cambridge
34. F.P. Preparata, and M.I. Shamos Computational Geometry: An Introduction 1985 Springer New York
35. R. Randell Conformation spaces of molecular rings Studies in Physical and Theoretical Chemistry 1988 Elsevier Amsterdam 141 156
36. R. Randell A molecular conformation space Studies in Physical and Theoretical Chemistry 1988 Elsevier Amsterdam 125 140
37. Yu.G. Reshetnyak On a method of transforming a nonconvex polygonal line into a convex one Uspehi Mat. Nauk 12 3 1957 189 191 In Russian
38. S.A. Robertson Inflation of plane curves Geometry and Topology of Submanifolds-III 1991 World Scientific Singapore 264 275
39. S.A. Robertson, and B. Wegner Full and partial inflation of plane curves Intuitive Geometry, Colloquia Math. Soc. Janos Bolyai 1994 North-Holland Amsterdam 389 401
40. G.T. Sallee Stretching chords of space curves Geom. Dedicata 2 1973 311 315
41. M. Soss, and G.T. Toussaint Convexifying polygons in 3d: a survey Contemp. Math. 304 2002 269 285
42. C.E. Soteros, and S.G. Whittington Polygons and stars in a slit geometry J. Phys. A 21 1988 L857 L861
43. S.D. Stellman, and P.J. Gans Efficient computer simulation of polymer conformation. I. Geometric properties of the hard-sphere model Macromolecules 5 1972 516 526
44. J. Strantzen, and J. Brooks A chord stretching map of a convex loop is an isometry Geom. Dedicata 41 1992 51 62
45. I. Streinu A combinatorial approach to planar non-colliding robot arm motion planning Proceedings of the 41st Annual Symposium on the Foundations of Computer Science, Redondo Beach, CA 2000
46. G.T. Toussaint Computational polygonal entanglement theory VIII Encuentros de Geometría Computacional, Castellon, Spain 1999 269 278
47. Pol 6 Contributions to Algebra and Geometry 42 2 2001 301 306
48. G.T. Toussaint Simple proofs of a geometric property of four-bar linkages Amer. Math. Monthly 110 6 2003 482 494
49. E.J. Janse van Rensburg, S.G. Whittington, and N. Madras The pivot algorithm and polygons: results on the FCC lattice J. Phys. A 23 1990 1589 1612
50. B. Wegner Partial inflation of closed polygons in the plane Contributions to Algebra and Geometry 34 1 1993 77 85
51. B. Wegner, Chord-stretched convex versions of planar curves with self-intersections, Technical Report, Department of Mathematics, Technical University of Berlin, 1999
52. S.G. Whittington Self-avoiding walks with geometrical constraints J. Statist. Phys. 30 2 1983 449 456
53. A.Ya. Yusupov A property of simply-connected nonconvex polygons Uchen. Zapiski Buharsk. Gos. Pedagog. 1957 101 103 In Russian