Design and Automated Generation of Japanese Picture Puzzles

Simple item page
dc.contributor.authorKerkhof, Mees van deen_US
dc.contributor.authorJong, Tim deen_US
dc.contributor.authorParment, Raphaelen_US
dc.contributor.authorLöffler, Maartenen_US
dc.contributor.authorVaxman, Amiren_US
dc.contributor.authorvan Kreveld, Marcen_US
dc.contributor.editorAlliez, Pierre and Pellacini, Fabioen_US
dc.date.accessioned2019-05-05T17:41:20Z
dc.date.available2019-05-05T17:41:20Z
dc.date.issued2019
dc.description.abstractWe introduce the generalized nonogram, an extension of the well-known nonogram or Japanese picture puzzle. It is not based on a regular square grid but on a subdivision (arrangement) with differently shaped cells, bounded by straight lines or curves. To generate a good, clear puzzle from a filled line drawing, the arrangement that is formed for the puzzle must meet a number of criteria. Some of these relate to the puzzle and some to the geometry. We give an overview of these criteria and show that a puzzle can be generated by an optimization method like simulated annealing. Experimentally, we analyze the convergence of the method and the remaining penalty score on several input pictures along with various other design options.en_US
dc.description.number2
dc.description.sectionheadersModeling
dc.description.seriesinformationComputer Graphics Forum
dc.description.volume38
dc.identifier.doi10.1111/cgf.13642
dc.identifier.issn1467-8659
dc.identifier.pages343-353
dc.identifier.urihttps://doi.org/10.1111/cgf.13642
dc.identifier.urihttps://diglib.eg.org:443/handle/10.1111/cgf13642
dc.publisherThe Eurographics Association and John Wiley & Sons Ltd.en_US
dc.subjectApplied computing
dc.subjectComputer games
dc.subjectHuman
dc.subjectcentered computing
dc.subjectVisualization systems and tools
dc.titleDesign and Automated Generation of Japanese Picture Puzzlesen_US
Files
Collections
38-Issue 2