Strictly-Convex Drawings of $3$-Connected Planar Graphs

Abstract: Strictly-convex straight-line drawings of $3$-connected planar graphs in small area form a classical research topic in Graph Drawing. Currently, the best-known area bound for such drawings is $O(n²⁾ \times O(n<sup>2)$, as shown by B\'{a}r\'{a}ny and Rote by means of a sophisticated technique based on perturbing (non-strictly) convex drawings. Unfortunately, the hidden constants in such area bound are in the $10^4$ order. We present a new and easy-to-implement technique that yields strictly-convex straight-line planar drawings of $3$-connected planar graphs on an integer grid of size $2(n-1) \times (5n<sup>3-4n<sup>2)$.