Polygons flip finitely: Flaws and a fix

Erik D. Demaine, Blaise Gassend, Joseph O’Rourke, Godfried T. Toussaint

Research output: Contribution to conferencePaperpeer-review

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.

Original languageEnglish (US)
Pages109-112
Number of pages4
StatePublished - Jan 1 2006
Event18th Annual Canadian Conference on Computational Geometry, CCCG 2006 - Kingston, Canada
Duration: Aug 14 2006Aug 16 2006

Conference

Conference18th Annual Canadian Conference on Computational Geometry, CCCG 2006
CountryCanada
CityKingston
Period8/14/068/16/06

ASJC Scopus subject areas

  • Geometry and Topology
  • Computational Mathematics

Fingerprint Dive into the research topics of 'Polygons flip finitely: Flaws and a fix'. Together they form a unique fingerprint.

Cite this