Flat-state connectivity of linkages under dihedral motions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2518 LNCS, Issue , 2002, Pages 369-380

  Aloupis, Greg ^a   Demaine, Erik D ^b   Dujmović, Vida ^a   Erickson, Jeff ^c   Langerman, Stefan ^a   Meijer, Henk ^d   O'Rourke, Joseph ^e   Overmars, Mark ^f   Soss, Michael ^g   Streinu, Ileana ^e   Toussaint, Godfried T ^a  

^a MCGILL UNIVERSITY   (Canada)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

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

^d QUEEN S UNIVERSITY   (Canada)

^e SMITH COLLEGE   (United States)

^f UTRECHT UNIVERSITY   (Netherlands)

^g Chemical Computing Group Inc   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EMBEDDINGS; OPEN CHAIN; ORTHOGONAL GRAPHS; PROTEIN MODELS; SELF-INTERSECTIONS;

ALGORITHMS; CHAINS;

DIHEDRAL ANGLE;

EID: 84878659823     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36136-7_33     Document Type: Conference Paper

References (15)

1. Oswin Aichholzer, Carmen Cortés, Erik D. Demaine, Vida Dujmović, Jeff Erickson, Henk Meijer, Mark Overmars, Belén Palop, Suneeta Ramaswami, and GodfriedT. Toussaint. Flipturning polygons. In Proc. Japan Conf. Discrete Comput. Geom., Lecture Notes in Computer Science, Tokyo, Japan, November 2000. To appear in Discrete Comput. Geom.
2. Greg Aloupis, Erik D. Demaine, Henk Meijer, Joseph O'Rourke, Ileana Streinu, and Godfried Toussaint. Flat-state connectedness of fixed-angle chains: Special acute chains. In Proc. 14th Canad. Conf. Comput. Geom., August 2002.
3. T. Biedl, E. Demaine, M. Demaine, S. Lazard, A. Lubiw, J. O'Rourke, M. Overmars, S. Robbins, I. Streinu, G. Toussaint, and S. Whitesides. Lockedandunlocked polygonal chains in 3D. Discrete Comput. Geom., 26(3):269-282, 2001.
4. J. Cantarella and H. Johnston. Nontrivial embeddings of polygonal intervals and unknots in 3-space. J. Knot Theory Ramifications, 7:1027-1039, 1998. (Pubitemid 128501105)
5. R. Connelly, E. D. Demaine, and G. Rote. Straightening polygonal arcs and convexifying polygonal cycles. In Proc. 41st Annu. IEEE Sympos. Found. Comput. Sci., pages 432-442. IEEE, November 2000. (Pubitemid 32075912)
6. Maxim D. Frank-Kamenetskii. Unravelling DNA. Addison-Wesley, 1997.
7. M. Lal. Monte Carlo computer simulations of chain molecules. Molecular Physics, 17:57-64, 1969.
8. B. MacDonald, N. Jan, D. L. Hunter, and M. O. Steinitz. Polymer conformations through wiggling. Journal of Physics A: Mathematical and General Physics, 18:2627-2631, 1985.
9. N. Madras, A. Orlitsky, and L. A. Shepp. Monte Carlo generation of self-avoiding walks with fixedendpoints and fixedlength. Journal of Statistical Physics, 58:159-183, 1990.
10. Neal Madras and Gordon Slade. The Self-Avoiding Walk. Birkhauser, 1993.
11. M. Soss and G. T. Toussaint. Geometric and computational aspects of polymer reconfiguration. J. Math. Chemistry, 27(4):303-318, 2000. (Pubitemid 33246444)
12. C. E. Soteros and S. G. Whittington. Polygons and stars in a slit geometry. Journal of Physics A: Mathematical and General Physics, 21:L857-L861, 1988.
13. I. Streinu. A combinatorial approach to planar non-colliding robot arm motion planning. In Proc. 41st Annu. IEEE Sympos. Found. Comput. Sci. IEEE, November 2000. 443-453. (Pubitemid 32075913)
14. G. T. Toussaint. The Erdos-Nagy theorem and its ramifications. In Proc. 11th Canad. Conf. Comput. Geom., pages 9-12, 1999.
15. S. G. Whittington. Self-avoiding walks with geometrical constraints. Journal of Statistical Physics, 30(2):449-456, 1983.