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
16 Citations
Polygons Needing Many Flipturns
  • T. Biedl
  • Mathematics, Computer Science
  • Discret. Comput. Geom.
  • 2006
  • 5
  • Highly Influenced
  • PDF
The Erdös-Nagy theorem and its ramifications
  • 41
  • PDF
Reconfigurations of polygonal structures
  • 7
  • PDF
Convexifying Polygons Without Losing Visibilities
  • 18
  • PDF
On convexification of polygons by pops
  • 3
  • PDF
Convexifying Monotone Polygons while Maintaining Internal Visibility
  • 3
  • PDF
Folding and unfolding
  • 50
  • PDF
Generating Random Orthogonal Polygons
  • 13
  • PDF
Convexification of polygons by length preserving transformations
Measuring Convexity via Convex Polygons
  • 1
  • PDF
...
1
2
...

References

SHOWING 1-10 OF 41 REFERENCES
The Erdös-Nagy theorem and its ramifications
  • 41
  • PDF
Computational Polygonal Entanglement Theory
  • 6
Linear-time triangulation of a simple polygon made easier via randomization
  • 29
  • PDF
Flipping your Lid
  • 11
  • Highly Influential
  • PDF
Folding and unfolding
  • 50
  • PDF
Sorting Permutations by Reversals and Eulerian Cycle Decompositions
  • A. Caprara
  • Computer Science, Mathematics
  • SIAM J. Discret. Math.
  • 1999
  • 192
Triangulating a simple polygon in linear time
  • B. Chazelle
  • Mathematics, Computer Science
  • Discret. Comput. Geom.
  • 1991
  • 744
  • PDF
Self-avoiding random loops
  • 23
  • PDF
Convexification of polygons by flips and by flipturns
  • 19
  • PDF
...
1
2
3
4
5
...