Skip to main navigation Skip to search Skip to main content

Mapping Multiple Regions to the Grid with Bounded Hausdorff Distance

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

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.
Original languageEnglish
Title of host publicationAlgorithms and Data Structures
Subtitle of host publication17th International Symposium, WADS 2021, Virtual Event, August 9–11, 2021, Proceedings
EditorsAnna Lubiw, Mohammad Salavatipour, Meng He
PublisherSpringer
Pages627-640
Edition1
ISBN (Electronic)978-3-030-83508-8
ISBN (Print)978-3-030-83507-1
DOIs
Publication statusPublished - 2021

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume12808
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Keywords

  • Computational geometry
  • Digital geometry
  • Hausdorffdistance
  • Simple polygons

Fingerprint

Dive into the research topics of 'Mapping Multiple Regions to the Grid with Bounded Hausdorff Distance'. Together they form a unique fingerprint.

Cite this