The pockets of a simple polygon are the areas outside the polygon, but inside its convex hull. Let P1 be a simple polygon with m vertices, and assume that a triangulation of P1 as well as its pockets is given. Let P2 be a convex polygon with n vertices. Show that the intersection P1 P2 can be computed in O(m + n) time.