According to the solution of closet pair (euclid distance) with divide and conquer algorithm during merge algorithm we prove that for each point at distance d (minimum distance of two different sub problem) from line L we just need to check 6 points. But how about Manhattan distance, how many points should we check?
According to below picture, 4 points is it true?