7. (10 points) Suppose you are given a set L of n line segments in the plane, where each segment has one endpoint on the
Posted: Sat May 14, 2022 6:53 pm
7. (10 points) Suppose you are given a set L of n line segments
in the plane, where each
segment has one endpoint on the vertical line x = 0 and one
endpoint on the vertical
line x = 1, and all 2n endpoints are distinct. Describe and analyze
an algorithm to
compute the largest subset of L in which no pair of segments
intersects.
in the plane, where each
segment has one endpoint on the vertical line x = 0 and one
endpoint on the vertical
line x = 1, and all 2n endpoints are distinct. Describe and analyze
an algorithm to
compute the largest subset of L in which no pair of segments
intersects.