Discretized approaches to schematization

M. Löffler, W. Meulemans

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

8 Citations (Scopus)
160 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.
Original languageEnglish
Title of host publication29th Canadian Conference on Computational Geometry (CCCG)
Number of pages6
Publication statusPublished - 2017
Event29th Canadian Conference on Computational Geometry (CCCG 2017) - Ottawa, Canada
Duration: 26 Jul 201728 Jul 2017
Conference number: 29


Conference29th Canadian Conference on Computational Geometry (CCCG 2017)
Abbreviated titleCCCG 2017
Internet address


Dive into the research topics of 'Discretized approaches to schematization'. Together they form a unique fingerprint.

Cite this