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

Answer:

sorry but manu es da answer nhi pta

Answer 2

Answer:

Let L be a set of n lines in the plane, not necessarily in general position. We present an efficient algorithm for finding all the vertices of the arrangement A(L) of ... other lines of L. It is straightforward2 to find, in O(nlog n) overall time, these ... In Section 2 we give the proofs of Theorem 1.1 and Theorem 1.2,.