Share on Facebook Share on Twitter Email
Answers.com

Planarity

 
Wikipedia: Planarity
 
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]

References

External links


Search unanswered questions...
Enter a word or phrase...
All Community Q&A Reference topics
 
 
Learn More
maximal planar graph (mathematics)
planar
curve

Post a question - any question - to the WikiAnswers community:

 

Copyrights:

Wikipedia. This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Planarity" Read more

 

Mentioned in