a. Line segment intersection problems
b. Testing two segments = four orientation tests
c. Sweep algorithm intuition
d. Sweep status data structure: balanced BST using orientation tests for comparisons
e, Deciding if any two segments intersect in O(n log n) time