Work Note 2, DM819, fall 2009
Exercises September 1
-
Exercises 1.1, 1.2, 1.3, 1.4.a, 1.7, 1.8, 1.9.
Exercises September 2
-
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.
Last modified: Thu Aug 27 06:17:41 CEST 2009
Kim Skak Larsen
(kslarsen@imada.sdu.dk)