Convexifying monotone polygons

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

Volumn 1741, Issue , 1999, Pages 415-424

  Biedl, Therese C ^a   Demaine, Erik D ^a   Lazard, Sylvain ^b   Robbins, Steven M ^c   Soss, Michael A ^c  

^a UNIVERSITY OF WATERLOO   (Canada)

^b LORIA   (France)

^c MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CONVEX POLYGON; POLYGON EDGES; RIGID LINKS; VERTICAL LINES;

GEOMETRY;

EID: 84958056826     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46632-0_42     Document Type: Conference Paper

References (10)

1. T. Biedl, E. Demaine, M. Demaine, S. Lazard, A. Lubiw, J. O'Rourke, M. Over-mars, S. Robbins, I. Streinu, G. Toussaint, and S. Whitesides. Locked and unlocked polygonal chains in 3D. Manuscript in preparation, 1999. A preliminary version appeared in Proc. 10th ACM-SIAM Sympos. Discrete Algorithms, 1999, 866-867.
2. Therese Biedl, Erik Demaine, Martin Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried Toussaint, and Sue Whitesides. On reconfiguring tree linkages: Trees can lock. In Proc. 10th Canadian Conf. Comput. Geom., Montreal, Aug. 1998.
3. Prosenjit Bose, William Lenhart, and Giuseppe Liotta. Personal comm., 1999.
4. Roxana Cocan and Joseph O'Rourke. Polygonal chains cannot lock in 4D. In Proc. 11th Canadian Conf. Comput. Geom., Vancouver, Aug. 1999.
5. H. Everett, S. Lazard, S. Robbins, H. Schroder, and S. Whitesides. Convexifying star-shaped polygons. In Proc. 10th Canadian Conf. Comput. Geom., Montreal, Aug. 1998.
6. W. J. Lenhart and S. H. Whitesides. Reconfiguring closed polygonal chains in Euclidean d-space. Discrete Comput. Geom., 13:123-140, 1995.
7. Joseph O'Rourke. Folding and unfolding in computational geometry. In Proc. Japan Conf. Discrete and Computational Geometry, Tokyo, Dec. 1998. To appear.
8. Godfried Toussaint. The Erdos-Nagy theorem and its ramifications. In Proc. 11th Canadian Conf. Comput. Geom., Vancouver, Aug. 1999.
9. Sue Whitesides. Algorithmic issues in the geometry of planar linkage movement. Australian Computer Journal, 24(2):42-50, May 1992.
10. Sue Whitesides. Personal communication, Oct. 1998.