Polygons needing many flipturns

Discrete and Computational Geometry

Volumn 35, Issue 1, 2006, Pages 131-141

  Biedl, Therese ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 30744472420     PISSN: 01795376     EISSN: 14320444     Source Type: Journal    
DOI: 10.1007/s00454-005-1185-z     Document Type: Article

References (6)

1. [ABC+] H.-K. Ahn, P. Bose, J. Czyzowicz, N. Hanusse, E. Kranakis, and P. Morin. Flipping your lid.Geombinatoncs, X(2):57-63, 2000.
2. [ACD+] O. Aichholzer, C. Cortés, E. Demaine, V. Dujmović J. Ericksen, H. Meijer, M. Overmars, B. Palop, S. Ramaswami, and G. Toussaint. Flipturning polygons. Discrete Comput. Geom., 28:231-253, 2002.
3. [CDR] R. Connelly, E. Demaine, and G. Rote. Straightening polygonal arcs and convexifying polygonal chains. Discrete Comput. Geom., 30(2):205-239, 2003.
4. [DORS] L. Dubins, A. Orlitsky, J. Reeds, and L. Shepp. Self-avoiding random loops. IEEE Trans. Inform. Theory, 34(6): 1509-1516, 1988.
5. [G] B. Grünbaum. How to convexity a polygon. Geombinatorics, 5:24-30, 1995.
6. [T] G. Toussaint. The Erdös-Nagy theorem and its ramifications. In Canadian Conference on Computational Geometry, pages 9-13, 1999.