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

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

Onderzoeksoutput: Bijdrage aan congresAbstract

29 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
Pagina's247-250
Aantal pagina's4
StatusGepubliceerd - 1 apr 2016
Evenement32nd European Workshop on Computational Geometry (EuroCG 2016) - Lugano, Zwitserland
Duur: 30 mrt 20161 apr 2016
Congresnummer: 32
http://www.eurocg2016.usi.ch/

Workshop

Workshop32nd European Workshop on Computational Geometry (EuroCG 2016)
Verkorte titelEuroCG 2016
LandZwitserland
StadLugano
Periode30/03/161/04/16
Internet adres

    Vingerafdruk

Citeer dit

Bouts, Q. W., Kostitsyna, I., van Kreveld, M. J., Meulemans, W., Sonke, W. M., & Verbeek, K. A. B. (2016). Mapping polygons to the grid with small Hausdorff and Fréchet distance. 247-250. Abstract van 32nd European Workshop on Computational Geometry (EuroCG 2016), Lugano, Zwitserland.