Mapping multiple regions to the grid with bounded Hausdorff distance

DOI10.1007/978-3-030-83508-8_45OpenAlexW3187232146MaRDI QIDQ832913

Jordi L. Vermeulen, Mees van de Kerkhof, Jérôme Urhausen, Maarten Löffler, Ivor van der Hoog, Frank Staals, Marc J. van Kreveld

Publication date: 25 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-83508-8_45

zbMATH Keywords

simple polygonscomputational geometryHausdorff distancedigital geometry

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Consistent digital line segments
• An intersection-sensitive algorithm for snap rounding
• Digital straightness -- a review
• Stable snap rounding
• Dynamic Planar Point Location with Sub-logarithmic Local Updates
• Computing Two-Dimensional Integer Hulls
• The Painter’s Problem: Covering a Grid with Colored Connected Polygons
• Consistent digital rays

This page was built for publication: Mapping multiple regions to the grid with bounded Hausdorff distance