Mathematics Colloquia and Seminars

Return to Colloquia & Seminar listing

We start with a polygon in the plane which we would like to make convex while preserving side lengths. There are several different systems of allowable moves, but in general we seek:

1. A proof that (some large class of) polygons may be convexified 2. An efficient algorithm for the process

We will see a few versions of this problem, some of their solutions, and a surprising picture or two.