| dc.rights.license | CC-BY-NC-ND | |
| dc.contributor.advisor | Kreveld, M. van | |
| dc.contributor.advisor | Löffler, M. | |
| dc.contributor.author | Kapel, T. van | |
| dc.date.accessioned | 2014-08-11T17:00:51Z | |
| dc.date.available | 2014-08-11T17:00:51Z | |
| dc.date.issued | 2014 | |
| dc.identifier.uri | https://studenttheses.uu.nl/handle/20.500.12932/17601 | |
| dc.description.abstract | In this thesis we present a new variation of the existing connect the dots puzzles. The goal of the puzzle is similar to those connect the dots puzzles, where an illustration is revealed by connecting pairs of dots via line segments. The puzzle uses colors and the distance between dots to define which pairs of dots to connect. An algorithm is presented that allows for automatic generation of such puzzles from a planar graph in the shape of the illustration. | |
| dc.description.sponsorship | Utrecht University | |
| dc.format.extent | 4223082 | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | en | |
| dc.title | Connect The Closest Dot Puzzles | |
| dc.type.content | Master Thesis | |
| dc.rights.accessrights | Open Access | |
| dc.subject.keywords | connect the dots, closest, puzzle, puzzles, line simplification, graph | |
| dc.subject.courseuu | Game and Media Technology | |
