Document Type

Conference Proceeding

Publication Date

1-1-2006

Publication Title

Proceedings of the 18th Annual Canadian Conference on Computational Geometry, CCCG 2006

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.

First Page

109

Last Page

112

Rights

© the authors

Comments

Archived as published.

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.