Work Note 3, DM819, fall 2011
Exercises September 13
-
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 Sep 1 14:36:42 CEST 2011
Kim Skak Larsen
(kslarsen@imada.sdu.dk)