This shows you the differences between the selected revision and the current version of the page.
| news 10:27 29.09.2008 | news 12:00 29.09.2008 current | ||
|---|---|---|---|
| Line 1: | Line 1: | ||
| ====== News ====== | ====== News ====== | ||
| + | |||
| Line 6: | Line 7: | ||
| ===== September 29th, 2008: OGDF team wins Graph Drawing 2008 challenge ===== | ===== September 29th, 2008: OGDF team wins Graph Drawing 2008 challenge ===== | ||
| - | {{ :gd-trophy.jpg?200px}} | + | {{ :gd-trophy.png?200px}} |
| The OGDF team of TU Dortmund wins the [[http://www.graphdrawing.de/contest2008/gdchallenge2008.html|GD 2008 challenge]] in automatic upward crossing minimization at the [[http://www.ics.forth.gr/gd2008/|Graph Drawing conference]] in Heraklion, Crete. The winning software used ogdf's upward planarization algorithm, to be available in ogdf's upcoming Sassafras release, and achieved a perfect score of 6 out of 6 points. The competition also included the commercial software by Tom Sawyer as well as AT&T's GraphViz. | The OGDF team of TU Dortmund wins the [[http://www.graphdrawing.de/contest2008/gdchallenge2008.html|GD 2008 challenge]] in automatic upward crossing minimization at the [[http://www.ics.forth.gr/gd2008/|Graph Drawing conference]] in Heraklion, Crete. The winning software used ogdf's upward planarization algorithm, to be available in ogdf's upcoming Sassafras release, and achieved a perfect score of 6 out of 6 points. The competition also included the commercial software by Tom Sawyer as well as AT&T's GraphViz. | ||
| ~~CL~~ | ~~CL~~ | ||
