Every three-connected planar graph with n vertices has a drawing on an O(n7/3) by O(n7/3) grid in which all faces are strictly convex polygons.
From: Strictly Convex Drawings of Planar Graphs by Günter Rote. (coming) SODA 2005.
