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 language | English (US) |
---|---|
Pages | 109-112 |
Number of pages | 4 |
State | Published - Jan 1 2006 |
Event | 18th Annual Canadian Conference on Computational Geometry, CCCG 2006 - Kingston, Canada Duration: Aug 14 2006 → Aug 16 2006 |
Conference
Conference | 18th Annual Canadian Conference on Computational Geometry, CCCG 2006 |
---|---|
Country/Territory | Canada |
City | Kingston |
Period | 8/14/06 → 8/16/06 |
ASJC Scopus subject areas
- Geometry and Topology
- Computational Mathematics