Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.SoCG.2020.80
URN: urn:nbn:de:0030-drops-122382
URL: https://drops.dagstuhl.de/opus/volltexte/2020/12238/
van Benthem, Toon ; Buchin, Kevin ; Kostitsyna, Irina ; Slot, Stijn
Designing Art Galleries (Media Exposition)
| pdf-format: |
|
Abstract
We present a method for generating interesting levels based on several NP-hardness reductions for a puzzle game based on the Art Gallery problem.
BibTeX - Entry
@InProceedings{vanbenthem_et_al:LIPIcs:2020:12238,
author = {Toon van Benthem and Kevin Buchin and Irina Kostitsyna and Stijn Slot},
title = {{Designing Art Galleries (Media Exposition)}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {80:1--80:5},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Sergio Cabello and Danny Z. Chen},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2020/12238},
URN = {urn:nbn:de:0030-drops-122382},
doi = {10.4230/LIPIcs.SoCG.2020.80},
annote = {Keywords: Art Gallery problem, NP-hard, puzzle, level generation}
}
| Keywords: | Art Gallery problem, NP-hard, puzzle, level generation | |
| Seminar: | 36th International Symposium on Computational Geometry (SoCG 2020) | |
| Issue date: | 2020 | |
| Date of publication: | 08.06.2020 | |
| Supplementary Material: | game: https://www.win.tue.nl/~kbuchin/proj/ruler/art/, source code: https://github.com/kbuchin/ruler/ |
