Mapping polygons to the grid with small Hausdorff and Fréchet distance

Q.W. Bouts, Irina Kostitsyna, M.J. van Kreveld, W. Meulemans, W.M. Sonke, K.A.B. Verbeek

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

4 Citaten (Scopus)
53 Downloads (Pure)

Samenvatting

We show how to represent a simple polygon P by a (pixel-based) grid polygon Q that is simple and whose Hausdorff or Fréchet distance to P is small. For any simple polygon P, a grid polygon exists with constant Hausdorff distance between their boundaries and their interiors. Moreover, we show that with a realistic input assumption we can also realize constant Fréchet distance between the boundaries. We present algorithms accompanying these constructions, heuristics to improve their output while keeping the distance bounds, and experiments to assess the output.

Originele taal-2Engels
TitelProc. 24th Annual European Symposium on Algorithms (ESA)
RedacteurenP. Sankowski, C. Zaroliagis
Plaats van producties.l.
UitgeverijSchloss Dagstuhl - Leibniz-Zentrum für Informatik
Pagina's1-16
ISBN van elektronische versie978-3-95977-015-6
DOI's
StatusGepubliceerd - 1 aug 2016
Evenement24th Annual European Symposium on Algorithms (ESA 2016) - Aarhus, Denemarken
Duur: 22 aug 201624 aug 2016
Congresnummer: 24
http://conferences.au.dk/algo16/esa/

Publicatie series

NaamLeibniz International Proceedings in Informatics
Volume57

Congres

Congres24th Annual European Symposium on Algorithms (ESA 2016)
Verkorte titelESA 2016
Land/RegioDenemarken
StadAarhus
Periode22/08/1624/08/16
Internet adres

Vingerafdruk

Duik in de onderzoeksthema's van 'Mapping polygons to the grid with small Hausdorff and Fréchet distance'. Samen vormen ze een unieke vingerafdruk.

Citeer dit