Talk:Planarity

Mac version at University of Western Australia

I am removing the following because it has no source:

A version of this game was running on Mac computers in the Department of Mathematics at The University of Western Australia in 1989.

Please return this once there is a source. --beefyt (talk) 23:05, 17 March 2010 (UTC)

Another relevant reference

I'm not adding this to the article for now because of my conflict of interest, but it's relevant and I hope someone else still watchlists this article and considers this worth adding. I have a paper

• Eppstein, David (2014), "Drawing arrangement graphs in small grids, or how to play planarity", Journal of Graph Algorithms and Applications, 18 (2): 211–231, doi:10.7155/jgaa.00319, MR 3213195

It considers the special class of graphs constructed by the puzzle generation algorithm (already described in the article) and proves two things about them:

• These graphs can always be drawn in a grid of much smaller area than the worst case for arbitrary planar graphs
• There is a simple strategy suitable for human game players that always correctly succeeds on these graphs, even though it may fail on arbitrary planar graphs.

—David Eppstein (talk) 03:27, 26 May 2015 (UTC)

The paper seems relevant to me (though it's not so useful for the non-planar graphs generated by gPlanarity...), so I added it. I'm sure it can be described better in the article, but it's a start. MarkGyver (talk) 00:42, 31 May 2015 (UTC)

External links modified

Hello fellow Wikipedians,

I have just added archive links to one external link on Planarity. Please take a moment to review my edit. If necessary, add {{cbignore}} after the link to keep me from modifying it. Alternatively, you can add {{nobots|deny=InternetArchiveBot}} to keep me off the page altogether. I made the following changes:

• Added archive https://web.archive.org/20060908170747/http://observer.case.edu/Archives/Volume_38/Issue_11/Story_379/ to http://observer.case.edu/Archives/Volume_38/Issue_11/Story_379/

When you have finished reviewing my changes, please set the checked parameter below to true to let others know.

This message was posted before February 2018. After February 2018, "External links modified" talk page sections are no longer generated or monitored by InternetArchiveBot. No special action is required regarding these talk page notices, other than regular verification using the archive tool instructions below. Editors have permission to delete these "External links modified" talk page sections if they want to de-clutter talk pages, but see the RfC before doing mass systematic removals. This message is updated dynamically through the template {{source check}} (last update: 5 June 2024).

• If you have discovered URLs which were erroneously considered dead by the bot, you can report them with this tool.
• If you found an error with any archives or the URLs themselves, you can fix them with this tool.

Cheers.—^{cyberbot II}_{Talk to my owner:Online} 23:13, 21 January 2016 (UTC)

Root definition

Wikipedia does not provide the actual definition for this term, although it may be found in Dictionary.com:

http://www.dictionary.com/browse/planarity

adjective

1. of or relating to a geometric plane.

2. flat or level.

Is there a problem with providing this in Wikipedia?

Kortoso (talk) 17:57, 26 July 2017 (UTC)

Perhaps it is because this article uses Planarity as a proper noun, the name of a game, and is unrelated to the adjective whose (rather poor) definition you have given above.--Bill Cherowitzo (talk) 03:28, 27 July 2017 (UTC)

Puzzle generation algorithm

Step 3 in the list and the ensuing discussion of L seem to be about generating a Complete Graph, which (except for very low number of nodes) would never be planar and is not what is present in the game. Dvd Avins (talk) 22:49, 8 May 2021 (UTC)

"Each line segment" means the segments of the generated lines, not segments of other lines. Following the link to arrangement should have made this clear. —David Eppstein (talk) 06:52, 9 May 2021 (UTC)