# 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

Chapter 22, Creativity #13

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?

## This problem has been solved!

Do you need an answer to a question different from the above? Ask your question!

**Related Book For**

## Algorithm Design And Applications

1st Edition

**Authors:** Michael T. Goodrich, Roberto Tamassia

**ISBN:** 9781118335918