3-coloring arrangements of line segments with 4 slopes is hard

Since the problem of computing a k-coloring of an arrangement of line segments is equivalent to computing the constrained geometric thickness of a straight-line drawing of a graph in the plane, our result extends to this problem.