Smallest Universal Set of Points for Planar Graphs

Let $u(n)$ be the minimum size of a planar point set $S$ such that every planar graph with $n$ vertices has a crossing-free straight-line drawing whose vertices are mapped injectively to points of $S$. Determine whether $u(n)=O(n)$.