# ICS 269, Spring 2005: Theory Seminar

## 21 Jan 2005:

Strictly Convex Drawings of Planar Graphs

Presented by Jeremy Yu Meng

Every three-connected planar graph with n vertices has a drawing on an
O(n^{7/3}) by O(n^{7/3})
grid in which all faces are strictly convex polygons.

From: Strictly Convex Drawings of Planar Graphs by Günter Rote.
(coming) SODA 2005.