Give an example set of line segments in a certain order,
so that the corresponding search structure of the trapezoidal map
of these segments will have quadratic size with respect to to the
number of segments (i.e., will exhibit the worst case space complexity).
Your example set should contain at least 5 segments.
Show the corresponding trapezoidal map and the search structure
for your example set and discuss why that particular order
(i.e., permutation) results in that worst case space.