Work Note 4, DM819, fall 2015

Lecture September 15

• Linear programming (sections 4.0 - 4.5).

Exercises September 17

• Exercises 2.1, 2.2, 2.3, 2.4, 2.14.
• Assume that we have n disjoint horizontal line segments and m disjoint vertical line segments. Give an O((m+n)log(m+n)) algorithm for finding the number of intersection points among the horizontal and vertical lines. Note that intersections point should not be reported; merely counted.