Paper by Erik D. Demaine

Reference:

Erik D. Demaine, Blaise Gassend, Joseph O'Rourke, and Godfried T. Toussaint, “Polygons Flip Finitely: Flaws and a Fix”, in Proceedings of the 18th Canadian Conference on Computational Geometry (CCCG 2006), August 14–16, 2006, pages 109–112.

BibTeX

@InProceedings{Flips_CCCG2006,
  AUTHOR        = {Erik D. Demaine and Blaise Gassend and Joseph O'Rourke and
                   Godfried T. Toussaint},
  TITLE         = {Polygons Flip Finitely: Flaws and a Fix},
  BOOKTITLE     = {Proceedings of the 18th Canadian Conference on
                   Computational Geometry (CCCG 2006)},
  bookurl       = {http://www.cs.queensu.ca/cccg/index.htm},
  MONTH         = {August 14--16},
  YEAR          = 2006,
  PAGES         = {109--112},

  length        = {4 pages},
  withstudent   = 1,
  unrefereed    = 1,
  ee            = {http://www.cs.queensu.ca/cccg/papers/cccg28.pdf},
  papers        = {Flips_DCG20},
  dblp          = {https://dblp.org/rec/conf/cccg/DemaineGOT06},
}

Abstract:

Every simple planar polygon can undergo only a finite number of pocket flips before becoming convex. Since Erdős posed this as an open problem in 1935, several independent purported proofs have been published. However, we uncover a plethora of errors and gaps in these arguments, and remedy these problems with a new (correct) proof.

Length:

The paper is 4 pages.

Availability:

The paper is available in PostScript (223k), gzipped PostScript (80k), and PDF (114k).

See information on file formats.

[Google Scholar search]

Related papers:

Flips_DCG20 (All Polygons Flip Finitely… Right?)