I you're destinations are convex then just check the point-plane distance of each polygon in the destination, and if the point is on the same side of all polygons then it's inside.
If they're concave, then the easiest is probably to divide them into convex subsections, for example with a BSP tree.