Discretized approaches to schematization

M. Löffler; W. Meulemans

Discretized approaches to schematization

M. Löffler, W. Meulemans

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/Congresprocedure › Conferentiebijdrage › Academic › peer review

7 Citaten (Scopus)

115 Downloads (Pure)

Samenvatting

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-2	Engels
Titel	29th Canadian Conference on Computational Geometry (CCCG)
Pagina's	220-225
Aantal pagina's	6
Status	Gepubliceerd - 2017
Evenement	29th Canadian Conference on Computational Geometry (CCCG 2017) - Ottawa, Canada Duur: 26 jul. 2017 → 28 jul. 2017 Congresnummer: 29 http://2017.cccg.ca/

Congres

Congres	29th Canadian Conference on Computational Geometry (CCCG 2017)
Verkorte titel	CCCG 2017
Land/Regio	Canada
Stad	Ottawa
Periode	26/07/17 → 28/07/17
Internet adres	http://2017.cccg.ca/

Toegang tot document

publishers versionDefinitieve gepubliceerde versie, 393 KB

Andere bestanden en links

Link to publication in Scopus

Citeer dit

@inproceedings{b4706896328d4c6385f816f5833ac3d0,

title = "Discretized approaches to schematization",

abstract = "For both the Fr{\'e}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{\'e}chet distance; (3) we permit S to have holes for the symmetric difference. Compilation copyright {\textcopyright} 2017 Michiel Smid Copyright of individual papers retained by authors.All right reserved.",

author = "M. L{\"o}ffler and W. Meulemans",

year = "2017",

language = "English",

pages = "220--225",

booktitle = "29th Canadian Conference on Computational Geometry (CCCG)",

note = "29th Canadian Conference on Computational Geometry (CCCG 2017), CCCG 2017 ; Conference date: 26-07-2017 Through 28-07-2017",

url = "http://2017.cccg.ca/",

}

TY - GEN

T1 - Discretized approaches to schematization

AU - Löffler, M.

AU - Meulemans, W.

N1 - Conference code: 29

PY - 2017

Y1 - 2017

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85072843618&partnerID=8YFLogxK

M3 - Conference contribution

SP - 220

EP - 225

BT - 29th Canadian Conference on Computational Geometry (CCCG)

T2 - 29th Canadian Conference on Computational Geometry (CCCG 2017)

Y2 - 26 July 2017 through 28 July 2017

ER -

Discretized approaches to schematization

Samenvatting

Congres

Toegang tot document

Andere bestanden en links

Vingerafdruk

Citeer dit