Smallest universal point sets for planar graphs

Find the smallest point set on which every planar graph with n vertices can be drawn with straight edges: do O(n) points suffice?