33.2-5: Use sweep-line approach. Consider polygons P and Q. They intersect if
and only if:
a) either a vertex of P lies inside Q, or vice versa,
b) or, there are sides of P and of Q which intersect.

Case (b) can be detected using segment intersection algorithms from the class,
with the convention that segments do NOT intersect if just their endpoints
coincide.
So, it suffices to check Case (a). This is done by a sweep-line approach, as in
Lecture 18.
For each position of the sweep-line L, maintain the intersection of  P with L.
Note that the intersection is a union U of O(n) intervals. Whenever a point q
in Q is encountered by the sweep line, we check if q is in U.

33.3-4: Use Graham's scan, as described in the recitations.

33.4-3 and 33.4-4: Show that the packing argument from Lecture 17, slide 10,
still goes through (possibly giving a different constant for different distance
functions). When the distances are measured according to L_1 (or L_infty)
distance function, how does a ball of radius d/2 look like?