论文标题
在曲线安排中删除流行的面孔
Removing Popular Faces in Curve Arrangements
论文作者
论文摘要
曲线布置中的面孔被称为流行，如果多次被相同的曲线界定。通过自动生成弯曲的非图形难题的动机，我们通过插入单个额外的曲线来调查在布置中消除流行面孔的可能性。事实证明这是NP-HARD；但是，当流行的面孔数量很少时，它就可以处理：我们在流行面孔的数量中提出了概率的FPT诉求。
A face in a curve arrangement is called popular if it is bounded by the same curve multiple times. Motivated by the automatic generation of curved nonogram puzzles, we investigate possibilities to eliminate the popular faces in an arrangement by inserting a single additional curve. This turns out to be NP-hard; however, it becomes tractable when the number of popular faces is small: We present a probabilistic FPT-approach in the number of popular faces.
