NP-hardness of geometric set cover and hitting set with rectangles containing a common point

We prove that both set cover and hitting set problems with points and axis-parallel rectangles are NP-hard even when (i) all rectangles share a common point and (ii) there are only two types of rectangles a×b and b×a for some positive integers a and b.