Improving Curve Arrangements Through Local Changes

Abstract

A curve arrangement can contain popular faces if a face is bounded the same curve multiple times. Popular faces and closed loops can make generated curved nonogram puzzles complex. To remove these features we make changes to small areas in the curve arrangement. We identify possible local changes in a curve arrangement and test several method that try to make the biggest improvement with the fewest changes.