Discretized approaches to schematization

M. Löffler, W. Meulemans

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

7 Citaten (Scopus)
115 Downloads (Pure)


For both the Fréchet distance and the symmetric difference, we show that finding the simple polygon S restricted to a grid that best resembles a simple polygon P is NP-complete, even if: (1) we require that S and P have equal area; (2) we require turns to occur in a specified sequence for the Fréchet distance; (3) we permit S to have holes for the symmetric difference. Compilation copyright © 2017 Michiel Smid Copyright of individual papers retained by authors.All right reserved.
Originele taal-2Engels
Titel29th Canadian Conference on Computational Geometry (CCCG)
Aantal pagina's6
StatusGepubliceerd - 2017
Evenement29th Canadian Conference on Computational Geometry (CCCG 2017) - Ottawa, Canada
Duur: 26 jul. 201728 jul. 2017
Congresnummer: 29


Congres29th Canadian Conference on Computational Geometry (CCCG 2017)
Verkorte titelCCCG 2017
Internet adres


Duik in de onderzoeksthema's van 'Discretized approaches to schematization'. Samen vormen ze een unieke vingerafdruk.

Citeer dit