[Back]

F. Klute, M. Löffler, M. Nöllenburg:
"Labeling nonograms: Boundary labeling for curve arrangements";
Computational Geometry - Theory and Applications, 98 (2021), 1 - 17.

Slanted and curved nonograms are a new type of picture puzzles introduced by Van de Kerkhof et al. (2019). They consist of an arrangement of lines or curves within a frame B, where some of the cells need to be colored in order to obtain the solution picture. For solving the puzzle, up to two clues need to be attached as numeric labels to each line on either side of B. In this paper we study the algorithmic problem of optimizing or deciding the existence of a placement of the given clue labels to such a nonogram. We provide polynomial-time algorithms for restricted cases and prove NP-completeness in general.

http://dx.doi.org/10.1016/j.comgeo.2021.101791

https://publik.tuwien.ac.at/files/publik_299992.pdf