Summary: The center of area of a convex planar set $X$ is the point $p$ for which the minimum area of $X$ intersected by any halfplane containing $p$ is maximized. We describe a simple randomized linear-time algorithm for computing the center of area of a convex $n$-gon.