Geometry and Generation of a New Graph Planarity Game
Files
Publication date
2019
Authors
Kraaijer, Rutger
van Kreveld, Marc
Meulemans, Wouter
Renssen, André van
Editors
Advisors
Supervisors
Document Type
Article
Metadata
Show full item recordCollections
License
taverne
Abstract
We introduce a new abstract graph game, Swap Planarity, where the goal is to reach a state without edge intersections and a move consists of swapping the locations of two vertices connected by an edge. We analyze this puzzle game using concepts from graph theory and graph drawing, computational geometry, and complexity. Furthermore, we specify quality criteria for puzzle instances, and describe a method to generate high-quality instances. We also report on experiments that show how well this generation process works.
Keywords
Taverne
Citation
Kraaijer, R, van Kreveld, M J, Meulemans, W & Renssen, A V 2019, 'Geometry and Generation of a New Graph Planarity Game', Journal of Graph Algorithms and Applications, vol. 23, no. 4, pp. 603-624. https://doi.org/10.7155/jgaa.00504