**F. Aurenhammer, R.L.S.Drysdale, and H. Krasser**

The farthest line segment Voronoi diagram shows properties different from both
the closest-segment Voronoi diagram and the farthest-point Voronoi diagram.
Surprisingly, this structure did not receive attention in the computational
geometry literature. We analyze its combinatorial and topological properties
and outline an time construction algorithm that is easy to
implement. No restrictions are placed upon the input line segments; they
are allowed to touch or cross.