Flipturning Polygons
@article{Aichholzer2000FlipturningP, title={Flipturning Polygons}, author={O. Aichholzer and C. Cort{\'e}s and E. Demaine and V. Dujmovic and Jeff Erickson and H. Meijer and M. Overmars and B. Palop and S. Ramaswami and G. Toussaint}, journal={Discrete & Computational Geometry}, year={2000}, volume={28}, pages={231-253} }
A flipturn transforms a nonconvex simple polygon into another simple polygon by rotating a concavity 180° around the midpoint of its bounding convex hull edge. Joss and Shannon proved in 1973 that a sequence of flipturns eventually transforms any simple polygon into a convex polygon. This paper describes several new results about such flipturn sequences. We show that any orthogonal polygon is convexified after at most n-5 arbitrary flipturns, or at most $\lfloor 5(n-4)/6 \rfloor$ well-chosen… Expand
Figures, Tables, and Topics from this paper
16 Citations
Polygons Needing Many Flipturns
- Mathematics, Computer Science
- Discret. Comput. Geom.
- 2006
- 5
- Highly Influenced
- PDF
Convexifying Monotone Polygons while Maintaining Internal Visibility
- Mathematics, Computer Science
- EGC
- 2011
- 3
- PDF
Convexification of polygons by length preserving transformations
- Computer Science, Mathematics
- Symposium on Computational Geometry
- 2010
References
SHOWING 1-10 OF 41 REFERENCES
Linear-time triangulation of a simple polygon made easier via randomization
- Mathematics, Computer Science
- SCG '00
- 2000
- 29
- PDF
Sorting Permutations by Reversals and Eulerian Cycle Decompositions
- Computer Science, Mathematics
- SIAM J. Discret. Math.
- 1999
- 192
Triangulating a simple polygon in linear time
- Mathematics, Computer Science
- Discret. Comput. Geom.
- 1991
- 744
- PDF
Convexification of polygons by flips and by flipturns
- Computer Science, Mathematics
- Discret. Math.
- 2001
- 19
- PDF