| dc.rights.license | CC-BY-NC-ND | |
| dc.contributor.advisor | Löffler, Maarten | |
| dc.contributor.author | Krijger, John | |
| dc.date.accessioned | 2022-09-09T04:02:29Z | |
| dc.date.available | 2022-09-09T04:02:29Z | |
| dc.date.issued | 2022 | |
| dc.identifier.uri | https://studenttheses.uu.nl/handle/20.500.12932/42727 | |
| dc.description.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. | |
| dc.description.sponsorship | Utrecht University | |
| dc.language.iso | EN | |
| dc.subject | In this thesis we try to improve curve arrangements used in curved nonogram puzzles by reducing the number of popular faces and closed loops. These improvements are made by making changes to small areas in a 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. | |
| dc.title | Improving Curve Arrangements Through Local Changes | |
| dc.type.content | Master Thesis | |
| dc.rights.accessrights | Open Access | |
| dc.subject.keywords | Curve Arrangements; Curved Nonograms; Popular Faces | |
| dc.subject.courseuu | Game and Media Technology | |
| dc.thesis.id | 10357 | |
