This article is rated B-class on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | ||||||||||||||||||||||||||||||||||||||||||||
|
External link: Pigale library includes the fastest implementation of the planarity testing and embedding algorithms (cf Stop minding your P’s and Q’s : implementing fast and simple DFS-based planarity and embedding algorithm, J.M. Boyer, P.F. Cortese, M. Patrignani, and G. Di Battista, in Graph Drawing, volume 2912 of Lecture Notes in Computer Science, 2004, pages 25–36). Is it sufficient for inclusion in the list? pom 22:08, 5 January 2007 (UTC)
May I rename this article to Graph layout(reversing the redirect)? I believe (but may be mistaken) that this is the common term for what is being described here. Rp 13:16, 13 November 2007 (UTC)
The image is not good. It's a tree (which always can be drawn planar), but it's not drawn planar. We should have a planar graph with lots of edges, possibly with relation to the four color theorem —Preceding unsigned comment added by 146.50.45.95 ( talk) 08:30, 8 April 2010 (UTC)
This section is misplaced, I think. It interprets the title as indicating the result, rather than the activity. Types of diagrams are discussed elsewhere (see e.g. diagram). Rp ( talk) 21:51, 10 October 2010 (UTC)
What software can be included here? What disqualifies, say, Gephi, that dioesn't disaqualify, say, MSAGL? Let's jot down some explicit criteria here. Rp ( talk) 11:39, 7 April 2011 (UTC)
Hello fellow Wikipedians,
I have just modified one external link on Graph drawing. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.
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).
Cheers.— InternetArchiveBot ( Report bug) 17:03, 22 October 2017 (UTC)
This article is rated B-class on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | ||||||||||||||||||||||||||||||||||||||||||||
|
External link: Pigale library includes the fastest implementation of the planarity testing and embedding algorithms (cf Stop minding your P’s and Q’s : implementing fast and simple DFS-based planarity and embedding algorithm, J.M. Boyer, P.F. Cortese, M. Patrignani, and G. Di Battista, in Graph Drawing, volume 2912 of Lecture Notes in Computer Science, 2004, pages 25–36). Is it sufficient for inclusion in the list? pom 22:08, 5 January 2007 (UTC)
May I rename this article to Graph layout(reversing the redirect)? I believe (but may be mistaken) that this is the common term for what is being described here. Rp 13:16, 13 November 2007 (UTC)
The image is not good. It's a tree (which always can be drawn planar), but it's not drawn planar. We should have a planar graph with lots of edges, possibly with relation to the four color theorem —Preceding unsigned comment added by 146.50.45.95 ( talk) 08:30, 8 April 2010 (UTC)
This section is misplaced, I think. It interprets the title as indicating the result, rather than the activity. Types of diagrams are discussed elsewhere (see e.g. diagram). Rp ( talk) 21:51, 10 October 2010 (UTC)
What software can be included here? What disqualifies, say, Gephi, that dioesn't disaqualify, say, MSAGL? Let's jot down some explicit criteria here. Rp ( talk) 11:39, 7 April 2011 (UTC)
Hello fellow Wikipedians,
I have just modified one external link on Graph drawing. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.
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).
Cheers.— InternetArchiveBot ( Report bug) 17:03, 22 October 2017 (UTC)