Question: Suppose you are given a set S of n line segments in the plane, such that each makes a positive angle with the x-axis of

Suppose you are given a set S of n line segments in the plane, such that each makes a positive angle with the x-axis of either 30 or 60 (so there are only two possible slopes for the lines in S). Describe an efficient algorithm for finding all the pairs of intersecting segments in S. What is the running time of your method?

Step by Step Solution

3.28 Rating (145 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

express the straight lines in the form of y ax b line pass... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Data Structures Algorithms Questions!