Mapping Multiple Regions To The Grid With Bounded Hausdorff Distance

We study a problem motivated by digital geometry: given a set of disjoint geometric regions, assign each region R-i a set of grid cells P-i, so that P-i is connected, similar to Ri, and does not touch any grid cell assigned to another region. Similarity is measured using the Hausdorff distance. We analyze the achievable Hausdorff distance in terms of the number of input regions, and prove asymptotically tight bounds for several classes of input regions.