Abstract
This paper considers reconfigurations of polygons, where each polygon edge is a rigid link, no two of which can cross during the motion. We prove that one can reconfigure any monotone polygon into a convex polygon; a polygon is monotone if any vertical line intersects the interior at a (possibly empty) interval. Our algorithm computes in O(n 2) time a sequence of O(n 2) moves, each of which rotates just four joints at once.
Research performed during a post-doctoral position at McGill University.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
T. Biedl, E. Demaine, M. Demaine, S. Lazard, A. Lubiw, J. O’Rourke, M. Overmars, 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.
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., Montréal, Aug. 1998.
Prosenjit Bose, William Lenhart, and Giuseppe Liotta. Personal comm., 1999.
Roxana Cocan and Joseph O’Rourke. Polygonal chains cannot lock in 4D. In Proc. 11th Canadian Conf. Comput. Geom., Vancouver, Aug. 1999.
H. Everett, S. Lazard, S. Robbins, H. Schröder, and S. Whitesides. Convexifying star-shaped polygons. In Proc. 10th Canadian Conf. Comput. Geom., Montr_eal, Aug. 1998.
W. J. Lenhart and S. H. Whitesides. Reconfiguring closed polygonal chains in Euclidean d-space. Discrete Comput. Geom., 13:123–140, 1995.
Joseph O’Rourke. Folding and unfolding in computational geometry. In Proc. Japan Conf. Discrete and Computational Geometry, Tokyo, Dec. 1998. To appear.
Godfried Toussaint. The Erdos-Nagy theorem and its ramifications. In Proc. 11th Canadian Conf. Comput. Geom., Vancouver, Aug. 1999.
Sue Whitesides. Algorithmic issues in the geometry of planar linkage movement. Australian Computer Journal, 24(2):42–50, May 1992.
Sue Whitesides. Personal communication, Oct. 1998.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Biedl, T.C., Demaine, E.D., Lazard, S., Robbins, S.M., Soss, M.A. (1999). Convexifying Monotone Polygons. In: Algorithms and Computation. ISAAC 1999. Lecture Notes in Computer Science, vol 1741. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46632-0_42
Download citation
DOI: https://doi.org/10.1007/3-540-46632-0_42
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66916-6
Online ISBN: 978-3-540-46632-1
eBook Packages: Springer Book Archive