Planarity is a puzzle computer game by John Tantalo, based on a concept by Mary Radcliffe at Western Michigan University. The name comes from the concept of planar graphs in graph theory; these are graphs that can be embedded in the Euclidean plane so that no edges intersect. By Fáry's theorem, if a graph is planar, it can be drawn without crossings so that all of its edges are straight line segments. In the planarity game, the player is presented with a circular layout of a planar graph, with all the vertices placed on a single circle and with many crossings. The goal for the player is to eliminate all of the crossings and construct a straight-line embedding of the graph by moving the vertices one by one into better positions.
History and versions
The game was written in Flash by John Tantalo at Case Western Reserve University. Online popularity and the local notoriety he gained placed Tantalo as one of Cleveland's most interesting people for 2006. It in turn has inspired the creation of a GTK+ version by Xiph.org's Chris Montgomery, which possesses additional level generation algorithms and the ability to manipulate multiple nodes at once.
Puzzle generation algorithm
The definition of the planarity puzzle does not depend on how the planar graphs in the puzzle are generated, but the original implementation uses the following algorithm:
- Generate a set of random lines in a plane such that no two lines are parallel and no three lines meet in a single point.
- Calculate the intersections of every line pair.
- Create a graph with a vertex for each intersection and an edge for each line segment connecting two intersections (the arrangement of the lines).
If a graph is generated from lines, then the graph will have exactly vertices (each line has vertices, and each vertex is shared with one other line) and edges (each line contains edges). The first level of Planarity is built with lines, so it has vertices and edges. Each level after is generated by one more line than the last. If a level was generated with lines, then the next level has more vertices and more edges.
The best known algorithms from computational geometry for constructing the graphs of line arrangements solve the problem in time, linear in the size of the graph to be constructed, but they are somewhat complex. Alternatively and more simply, it is possible to index each crossing point by the pair of lines that cross at that point, sort the crossings along each line by their -coordinates, and use this sorted ordering to generate the edges of the planar graph, in near-optimal time. Once the vertices and edges of the graph have been generated, they may be placed evenly around a circle using a random permutation.
Related theoretical research
The problem of determining whether a graph is planar can be solved in linear time, and any such graph is guaranteed to have a straight-line embedding by Fáry's theorem, that can also be found from the planar embedding in linear time. Therefore, any puzzle could be solved in linear time by a computer. However, these puzzles are not as straightforward for human players to solve.
In the field of computational geometry, the process of moving a subset of the vertices in a graph embedding to eliminate edge crossings has been studied by Pach and Tardos (2002), and others, inspired by the planarity puzzle. The results of these researchers shows that (in theory, assuming that the field of play is the infinite plane rather than a bounded rectangle) it is always possible to solve the puzzle while leaving of the input vertices fixed in place at their original positions, for a constant that has not been determined precisely but lies between 1/4 and slightly less than 1/2. When the planar graph to be untangled is a cycle graph, a larger number of vertices may be fixed in place. However, determining the largest number of vertices that may be left in place for a particular input puzzle (or equivalently, the smallest number of moves needed to solve the puzzle) is NP-complete.
Verbitsky (2008) has shown that the randomized circular layout used for the initial state of Planarity is nearly the worst possible in terms of its number of crossings: regardless of what planar graph is to be tangled, the expected value of the number of crossings for this layout is within a factor of three of the largest number of crossings among all layouts.
In 2014, mathematician David Eppstein published a paper providing an effective algorithm for solving planar graphs generated by the original Planarity game, based on the specifics of the puzzle generation algorithm.
- Arar, Yardena (August 1, 2005), "Cat's Cradle on Steroids", Today @ PC World, PCWorld, archived from the original on 2009-06-04 CS1 maint: discouraged parameter (link)
- Massie, Laura (2005-06-20). "Case student develops booming on-line game". Case Western Reserve University News Center. Retrieved 2007-09-30. CS1 maint: discouraged parameter (link)
- Castro, Laura (2005-11-18). "Case student one of Cleveland's "Most Interesting People"". The Observer. Archived from the original on September 8, 2006. Retrieved 2007-09-30. CS1 maint: discouraged parameter (link)
- "Most Interesting People 2006" (Press release). Cleveland Magazine. January 2006. Retrieved 2015-05-19. CS1 maint: discouraged parameter (link)
- "gPlanarity home".
- Chazelle, B.; Guibas, L. J.; Lee, D. T. (1985), "The power of geometric duality", BIT, 25 (1): 76–90, doi:10.1007/BF01934990
- Mehlhorn, K.; Mutzel, P. (1996), "On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm", Algorithmica, 16 (2): 233–242, doi:10.1007/s004539900046, hdl:11858/00-001M-0000-0014-B51D-B, MR 1394503
- de Fraysseix, Hubert; Pach, János; Pollack, Richard (1990), "How to draw a planar graph on a grid", Combinatorica, 10: 41–51, doi:10.1007/BF02122694, MR 1075065
- Pach, János; Tardos, Gábor (2002), "Untangling a polygon", Discrete & Computational Geometry, 28 (4): 585–592, doi:10.1007/s00454-002-2889-y
- Bose, Prosenjit; Dujmovic, Vida; Hurtado, Ferran; Langerman, Stefan; Morin, Pat; Wood, David R. (2008), "A polynomial bound for untangling geometric planar graphs", Discrete & Computational Geometry, 42 (4): 570–585, arXiv:0710.1641, doi:10.1007/s00454-008-9125-3
- Cibulka, Josef (2009), "Untangling Polygons and Graphs", Discrete & Computational Geometry, 43 (2): 402–411, arXiv:0802.1312, doi:10.1007/s00454-009-9150-x
- Goaoc, Xavier; Kratochvíl, Jan; Okamoto, Yoshio; Shin, Chan-Su; Spillner, Andreas; Wolff, Alexander (2009), "Untangling a Planar Graph", Discrete & Computational Geometry, 42 (4): 542–569, arXiv:0709.0170, doi:10.1007/s00454-008-9130-6
- Cano, Javier; Tóth, Csaba D.; Urrutia, Jorge (2014), "Upper bound constructions for untangling planar geometric graphs", SIAM Journal on Discrete Mathematics, 28 (4): 1935–1943, doi:10.1137/130924172, MR 3277216
- Verbitsky, Oleg (2008), "On the obfuscation complexity of planar graphs", Theoretical Computer Science, 396 (1–3): 294–300, arXiv:0705.3748, doi:10.1016/j.tcs.2008.02.032, MR 2412266
- Eppstein, David (2014), "Drawing arrangement graphs in small grids, or how to play planarity", Journal of Graph Algorithms and Applications, 18 (2): 211–231, arXiv:1308.0066, doi:10.7155/jgaa.00319, MR 3213195 CS1 maint: discouraged parameter (link)