Geometry and Generation of a New Graph Planarity Game | Zendy

Rutger Kraaijer | Zendy; Marc van Kreveld | Zendy; Wouter Meulemans | Zendy; André van Renssen | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Geometry and Generation of a New Graph Planarity Game

Author(s) -

Rutger Kraaijer,

Marc van Kreveld,

Wouter Meulemans,

André van Renssen

Publication year - 2019

Publication title -

journal of graph algorithms and applications

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.387

H-Index - 38

ISSN - 1526-1719

DOI - 10.7155/jgaa.00504

Subject(s) - planarity testing , graph , computer science , geometry , combinatorics , mathematics

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 what good levels look like and we show how they can be generated. We also report on experiments that show how well the generation works.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research