Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I have seen solutions involving sweeping line methods. But I need a divide and conquer method.
Basically i want to know if we divide the plane vertically into two subplanes and then try to solve the questions on both planes, do we have to take some special step in merging?
Would there be any special advantage of using divide and conquer in this problem ?
The only special steps would be handling vertical lines on the division line, and breaking divided horizontal line segments.