 |
This article is an orphan, as few or no other articles link to it. Please introduce links to this page from related articles; suggestions are available. (February 2009) |
- This article is about the game; for the graph theory property, see Planar graph.
Planarity is the name of a puzzle computer game based on a concept by Mary Radcliffe at Western Michigan University[1]. The name comes from the term planar graph. In graph theory, a planar graph is a graph that can be embedded in a plane so that no edges intersect. In the game, the player starts out with a tangled series of connected dots, and has to untangle the web until no edges intersect.
A version of this game was running on Mac computers in the Department of Mathematics at The University of Western Australia in 1989. The game was independently implemented as a Flash game by John Tantalo at Case Western Reserve University[2]. Online popularity and the local notoriety he gained placed Tantalo as one of Cleveland's most interesting people for 2006[3][4]. 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.[5]
In the field of computational geometry, the process of moving the vertices of a graph to eliminate edge crossings has been studied by Bose et al (to appear), Cibulka (to appear), Pach and Tardos (2002), and Goaoc (to appear) for example.
References
- ^ Krasean, Bill (August 10, 2005). "WMU student, partner create popular Web game". Kalamazoo Gazette (MI).
- ^ Massie, Laura (2005-06-20). "Case student develops booming on-line game". Case Western Reserve University News Center. http://www.case.edu/news/2005/7-05/planarity.htm. Retrieved 2007-09-30.
- ^ Castro, Laura (2005-11-18). "Case student one of Cleveland's "Most Interesting People"". The Observer. http://observer.case.edu/Archives/Volume_38/Issue_11/Story_379/. Retrieved 2007-09-30.
- ^ Cleveland Magazine (January, 2006). "Most Interesting People 2006". Press release. http://www.clevelandmagazine.com/ME2/dirmod.asp?sid=E73ABD6180B44874871A91F6BA5C249C&nm=Arts+%26+Entertainemnt&type=Publishing&mod=Publications%3A%3AArticle&mid=1578600D80804596A222593669321019&tier=4&id=5BE7EE32336E46ACA55FAE03A95E4E35. Retrieved 2007-09-30.
- ^ "gPlanarity home". http://web.mit.edu/xiphmont/Public/gPlanarity.html.
- Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, Stefan Langerman, Pat Morin, David R. Wood. "A polynomial bound for untangling geometric planar graphs". Discrete & Computational Geometry. doi:.
- Josef Cibulka. "Untangling Polygons and Graphs". Discrete & Computational Geometry. doi:.
- Janos Pach and G. Tardos (2002). "Untangling a polygon". Discrete & Computational Geometry 28: 585–592. doi:.
- Xavier Goaoc, Jan Kratochvíl, Yoshio Okamoto, Chan-Su Shin, Andreas Spillner and Alexander Wolff. "Untangling a Planar Graph". Discrete & Computational Geometry. doi:.
External links
- Planarity.net — the original Flash game
This entry is from Wikipedia, the leading user-contributed encyclopedia. It may not have been reviewed by professional editors (see full disclaimer)
