Question

Given a set L of n lines in the plane, give an O(nlogn) time algorithm to compute the maximum level of any vertex in the arrangement A(L).

Answer 1

itrmnt

<) rid. still.

time algorithm to compute the maximum level of any vertex in the arrangement A(L).