Mapping multiple regions to the grid with bounded Hausdorff distance

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

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

Publication date: 25 March 2022

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

zbMATH Keywords

Hausdorff distancecomputational geometrydigital geometrysimple polygons

Mathematics Subject Classification ID

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

Cites Work

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

   Recommendations

• Title not available (Why is that?) 👍 👎
• Fast conformal mapping of multiply connected regions 👍 👎
• Rapid methods for the conformal mapping of multiply connected regions 👍 👎
• Spatial discretization of mappings 👍 👎
• Title not available (Why is that?) 👍 👎
• On conformal mapping of polygonal regions 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Rapid and accurate computation of the distance function using grids 👍 👎
• Fast distance transformation on irregular two-dimensional grids 👍 👎

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832913)