Planarity

From Wikipedia, the free encyclopedia

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.

The original implementation of this game was a flash game developed 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]

[edit] References

  1. ^ Krasean, Bill. "WMU student, partner create popular Web game", Kalamazoo Gazette (MI), August 10, 2005. 
  2. ^ Massie, Laura (2005-06-20). Case student develops booming on-line game. Case Western Reserve University News Center. Retrieved on 2007-09-30.
  3. ^ Castro, Laura. "Case student one of Cleveland's "Most Interesting People"", The Observer, 2005-11-18. Retrieved on 2007-09-30. 
  4. ^ Cleveland Magazine (January, 2006). "Most Interesting People 2006". Press release. Retrieved on 2007-09-30.
  5. ^ gPlanarity home.

[edit] External links