Let S be a set of n line segments in the plane. The excess of S is the
number of repetitions of segments of S along the boundary of the same
face of A(S), summed over all segments and faces. We show that the ex
cess of S is at most O(n log log n), improving a previous O(n log n) b
ound given by Aronov and Sharir (1994).