The Erdös-Nagy theorem and its ramifications
暂无分享,去创建一个
[1] G. Toussaint. A new class of stuck unknots in . , 2001 .
[2] Prosenjit Bose,et al. Flipping your Lid , 2000, CCCG.
[3] Alon Orlitsky,et al. Monte Carlo generation of self-avoiding walks with fixed endpoints and fixed length , 1990 .
[4] Michael A. Soss,et al. Simple polygons with an infinite sequence of deflations. , 2001 .
[5] Stuart G. Whittington,et al. Polygons and stars in a slit geometry , 1988 .
[6] Jason H. Cantarella,et al. NONTRIVIAL EMBEDDINGS OF POLYGONAL INTERVALS AND UNKNOTS IN 3-SPACE , 1998 .
[7] B. Wegner. Partial Inflation of Closed Polygons in the Plane , 1993 .
[8] Avraham A. Melkman,et al. On-Line Construction of the Convex Hull of a Simple Polyline , 1987, Inf. Process. Lett..
[9] Lydia E. Kavraki,et al. Geometric Manipulation of Flexible Ligands , 1996, WACG.
[10] Branko Grünbaum,et al. Convexification of polygons by flips and by flipturns , 2001, Discret. Math..
[11] A chord-stretching map of a convex loop is an isometry , 1992 .
[12] Erik D. Demaine,et al. Locked and unlocked polygonal chains in 3D , 1998, SODA '99.
[13] David Avis,et al. A Linear Algorithm for Finding the Convex Hull of a Simple Polygon , 1979, Inf. Process. Lett..
[14] Erik D. Demaine,et al. Flipturning Polygons , 2000, ArXiv.
[15] Ileana Streinu,et al. A combinatorial approach to planar non-colliding robot arm motion planning , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[16] Erik D. Demaine,et al. Reconfiguring convex polygons , 2001, Comput. Geom..
[17] P. Bartlett. Studies in physical and theoretical chemistry : Vol. 55, semiconductor electrodes. H.O. Finklea (Editor). Elsevier, Amsterdam, 1988, xxii + 520 pp., Dfl.340.00, US$179.00 , 1988 .
[18] A. Sokal,et al. The pivot algorithm: A highly efficient Monte Carlo method for the self-avoiding walk , 1988 .
[19] G. Toussaint. A New Class of Stuck Unknots in Pol6 , 1999 .
[20] Alon Orlitsky,et al. Self-avoiding random loops , 1988, IEEE Trans. Inf. Theory.
[21] S. Whittington,et al. The pivot algorithm and polygons: results on the FCC lattice , 1990 .
[22] Erik D. Demaine,et al. Locked and Unlocked Polygonal Chains in Three Dimensions , 2001, Discret. Comput. Geom..
[23] G. Toussaint. Computational Polygonal Entanglement Theory , 1999 .
[24] Frank M. McMillan,et al. The Chain Straighteners , 1979 .
[25] M. Kapovich,et al. The symplectic geometry of polygons in Euclidean space , 1996 .
[26] Sue Whitesides,et al. Reconfiguring closed polygonal chains in Euclideand-space , 1995, Discret. Comput. Geom..
[27] K. Millett. KNOTTING OF REGULAR POLYGONS IN 3-SPACE , 1994 .
[28] J. O´Rourke,et al. Computational Geometry in C: Arrangements , 1998 .
[29] Jean-Marie Morvan,et al. Geometry and Topology of Submanifolds, II , 1990 .
[30] Günter Rote,et al. Every Polygon Can Be Untangled , 2000, EuroCG.
[31] Manuel Abellanas,et al. Tolerance of Geometric Structures , 1994, CCCG.
[32] Paul J. Gans,et al. Efficient Computer Simulation of Polymer Conformation. I. Geometric Properties of the Hard-Sphere Model , 1972 .
[33] Paul Erdös,et al. Problems for Solution: 3758-3763 , 1935 .
[34] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .
[35] N. Madras,et al. THE SELF-AVOIDING WALK , 2006 .
[36] S G Whittington,et al. Self-avoiding walks with geometrical constraints , 1983 .
[37] G. T. Sallee. Stretching chords of space curves , 1973 .