next up previous
Next: Polygons and Boolean Operations Up: Boolean Operations on Polygons Previous: Boolean Operations on Polygons

The Sweep Line Algorithm for Line Segment Intersection

discuss the Bentley-Ottman line segment intersection algorithm and go through the program as given in the LEDAbook. This part is based on section 10.7 of the LEDA book

lectures: Oct 23, Oct 25, Oct 30,

Kurt Mehlhorn