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 $\mathsf{NP}$-completeness in general.

中文翻译：

---

标记非图：曲线布置的边界标记

倾斜和弯曲的非图是Van de Kerkhof等人提出的新型图片拼图。（2019）。它们由帧B内的直线或曲线排列组成，其中一些单元需要着色才能获得解决方案图片。为了解决难题，最多需要将两个线索作为数字标签附加到B两侧的每一行上。在本文中，我们研究了优化或确定给定线索标签在此类非图上的放置位置的算法问题。我们提供了有限情况下的多项式时间算法，并证明了$\mathsf{NP}$-总体而言是完整的。