@inproceedings{42c2743f239541ff911546ccf681762f,
title = "Mapping Multiple Regions to the Grid with Bounded Hausdorff Distance",
abstract = "We study a problem motivated by digital geometry: given a set of disjoint geometric regions, assign each region Ri a set of grid cells Pi, so that Pi 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.",
keywords = "Computational geometry, Digital geometry, Hausdorffdistance, Simple polygons",
author = "\{van der Hoog\}, Ivor and \{van de Kerkhof\}, Mees and \{van Kreveld\}, Marc and Maarten L{\"o}ffler and Frank Staals and J{\'e}r{\^o}me Urhausen and Jordi Vermeulen",
year = "2021",
doi = "10.1007/978-3-030-83508-8\_45",
language = "English",
isbn = "978-3-030-83507-1",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "627--640",
editor = "Lubiw, \{Anna \} and Salavatipour, \{Mohammad \} and He, \{Meng \}",
booktitle = "Algorithms and Data Structures",
edition = "1",
}