Edge-Coloring Geometric Graphs

For a set of $n$ points in the plane in general position, draw a straight segment between every pair of points. What is the minimum number of colors that suffice to color the edges such that no two edges that cross have the same color? (With the general position assumption, all crossings are proper crossings.)