Line Intersection: a "brute force" algorithm
compare each line segment to every other line segment
The search for intersections of line segments can be carried out by comparing each line segment to each other line segment (O(N2)). Although some cases can be trivially rejected (both endpoints of one segment lie to the right of both endpoints of the other segment), many intersections must be directly computed, and then tested to be sure the intersection really does lie on both segments.
Movies are available for fifty (three movies) and one hundred (one movie) line segments ; one of the fifty-segment movies includes pauses for questions to the viewer. Remember the guidelines for use of these movies.
|
|
|
|
|
|
|
|
