Flipturning polygons

Oswin Aichholzer, Carmen Cortés, Erik D. Demaine, Vida Dujmović, Jeff Erickson, Henk Meijer, Mark Overmars, Belén Palop, Suneeta Ramaswami, Godfried Toussaint

    Research output: Contribution to journalArticle

    Abstract

    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 [5(n -4)/6] well-chosen flipturns, improving the previously best upper bound of (n - 1)!/2. We also show that any simple polygon can be convexified by at most n2-4n +1 flipturns, generalizing earlier results of Ahn et al. These bounds depend critically on how degenerate cases are handled; we carefully explore several possibilities. We prove that computing the longest flipturn sequence for a simple polygon is NP-hard. Finally, we show that although flipturn sequences for the same polygon can have significantly different lengths, the shape and position of the final convex polygon is the same for all sequences and can be computed in O(n log n) time.

    Original languageEnglish (US)
    Pages (from-to)231-253
    Number of pages23
    JournalDiscrete and Computational Geometry
    Volume28
    Issue number2
    DOIs
    StatePublished - Jan 1 2002

    Fingerprint

    Simple Polygon
    Polygon
    Convex polygon
    Orthogonal Polygons
    Transform
    Midpoint
    Concavity
    Convex Hull
    Rotating
    NP-complete problem
    Upper bound
    Computing
    Arbitrary

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Geometry and Topology
    • Discrete Mathematics and Combinatorics
    • Computational Theory and Mathematics

    Cite this

    Aichholzer, O., Cortés, C., Demaine, E. D., Dujmović, V., Erickson, J., Meijer, H., ... Toussaint, G. (2002). Flipturning polygons. Discrete and Computational Geometry, 28(2), 231-253. https://doi.org/10.1007/s00454-002-2775-7

    Flipturning polygons. / Aichholzer, Oswin; Cortés, Carmen; Demaine, Erik D.; Dujmović, Vida; Erickson, Jeff; Meijer, Henk; Overmars, Mark; Palop, Belén; Ramaswami, Suneeta; Toussaint, Godfried.

    In: Discrete and Computational Geometry, Vol. 28, No. 2, 01.01.2002, p. 231-253.

    Research output: Contribution to journalArticle

    Aichholzer, O, Cortés, C, Demaine, ED, Dujmović, V, Erickson, J, Meijer, H, Overmars, M, Palop, B, Ramaswami, S & Toussaint, G 2002, 'Flipturning polygons', Discrete and Computational Geometry, vol. 28, no. 2, pp. 231-253. https://doi.org/10.1007/s00454-002-2775-7
    Aichholzer O, Cortés C, Demaine ED, Dujmović V, Erickson J, Meijer H et al. Flipturning polygons. Discrete and Computational Geometry. 2002 Jan 1;28(2):231-253. https://doi.org/10.1007/s00454-002-2775-7
    Aichholzer, Oswin ; Cortés, Carmen ; Demaine, Erik D. ; Dujmović, Vida ; Erickson, Jeff ; Meijer, Henk ; Overmars, Mark ; Palop, Belén ; Ramaswami, Suneeta ; Toussaint, Godfried. / Flipturning polygons. In: Discrete and Computational Geometry. 2002 ; Vol. 28, No. 2. pp. 231-253.
    @article{f6a2153a1494445093e63c2f133f7001,
    title = "Flipturning polygons",
    abstract = "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 [5(n -4)/6] well-chosen flipturns, improving the previously best upper bound of (n - 1)!/2. We also show that any simple polygon can be convexified by at most n2-4n +1 flipturns, generalizing earlier results of Ahn et al. These bounds depend critically on how degenerate cases are handled; we carefully explore several possibilities. We prove that computing the longest flipturn sequence for a simple polygon is NP-hard. Finally, we show that although flipturn sequences for the same polygon can have significantly different lengths, the shape and position of the final convex polygon is the same for all sequences and can be computed in O(n log n) time.",
    author = "Oswin Aichholzer and Carmen Cort{\'e}s and Demaine, {Erik D.} and Vida Dujmović and Jeff Erickson and Henk Meijer and Mark Overmars and Bel{\'e}n Palop and Suneeta Ramaswami and Godfried Toussaint",
    year = "2002",
    month = "1",
    day = "1",
    doi = "10.1007/s00454-002-2775-7",
    language = "English (US)",
    volume = "28",
    pages = "231--253",
    journal = "Discrete and Computational Geometry",
    issn = "0179-5376",
    publisher = "Springer New York",
    number = "2",

    }

    TY - JOUR

    T1 - Flipturning polygons

    AU - Aichholzer, Oswin

    AU - Cortés, Carmen

    AU - Demaine, Erik D.

    AU - Dujmović, Vida

    AU - Erickson, Jeff

    AU - Meijer, Henk

    AU - Overmars, Mark

    AU - Palop, Belén

    AU - Ramaswami, Suneeta

    AU - Toussaint, Godfried

    PY - 2002/1/1

    Y1 - 2002/1/1

    N2 - 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 [5(n -4)/6] well-chosen flipturns, improving the previously best upper bound of (n - 1)!/2. We also show that any simple polygon can be convexified by at most n2-4n +1 flipturns, generalizing earlier results of Ahn et al. These bounds depend critically on how degenerate cases are handled; we carefully explore several possibilities. We prove that computing the longest flipturn sequence for a simple polygon is NP-hard. Finally, we show that although flipturn sequences for the same polygon can have significantly different lengths, the shape and position of the final convex polygon is the same for all sequences and can be computed in O(n log n) time.

    AB - 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 [5(n -4)/6] well-chosen flipturns, improving the previously best upper bound of (n - 1)!/2. We also show that any simple polygon can be convexified by at most n2-4n +1 flipturns, generalizing earlier results of Ahn et al. These bounds depend critically on how degenerate cases are handled; we carefully explore several possibilities. We prove that computing the longest flipturn sequence for a simple polygon is NP-hard. Finally, we show that although flipturn sequences for the same polygon can have significantly different lengths, the shape and position of the final convex polygon is the same for all sequences and can be computed in O(n log n) time.

    UR - http://www.scopus.com/inward/record.url?scp=0036025564&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=0036025564&partnerID=8YFLogxK

    U2 - 10.1007/s00454-002-2775-7

    DO - 10.1007/s00454-002-2775-7

    M3 - Article

    VL - 28

    SP - 231

    EP - 253

    JO - Discrete and Computational Geometry

    JF - Discrete and Computational Geometry

    SN - 0179-5376

    IS - 2

    ER -