Removing Popular Faces in Curve Arrangements
Computational Geometry
2023-08-31 v2
Abstract
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.
Cite
@article{arxiv.2202.12175,
title = {Removing Popular Faces in Curve Arrangements},
author = {Phoebe de Nooijer and Soeren Terziadis and Alexandra Weinberger and Zuzana Masárová and Tamara Mchedlidze and Maarten Löffler and Günter Rote},
journal= {arXiv preprint arXiv:2202.12175},
year = {2023}
}
Comments
Appears in the Proceedings of the 31st International Symposium on Graph Drawing and Network Visualization (GD 2023)