Edge-Coloring Geometric Graphs

For every set $S$ of $n$ planar points in general position, color the edges of the straight-line drawing of $K_n$ so that no two properly crossing edges share a color. Determine the minimum worst-case number of colors as a function of $n$.