News

The OGDF team of TU Dortmund wins the GD 2008 challenge in automatic upward crossing minimization at the 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 second public release of OGDF has been released today. This release focuses on improved usability, but also contains new functionality. Highlights of the new release are:

• A new algorithm for planar augmentation with fixed embedding, and extended functionality for drawing graphs with a given planar embedding.
• A new class DualGraph for representing the geometric dual graph of a combinatorial embedding.
• Sugiyama layout now produces drawings with given node ranks that are also respected across different connected components.
• Hashing functions can now be passed as template parameters; the implementation of two-dimensional hash-arrays has been revised and allows now using different types for each index. Array-based classes have now an optional template parameter for the index type.
• Unified naming conventions and interfaces; significantly improved documentation.
• Improved build system, including support for compiling with Osi Coin in Visual Studio and creating projects for Visual Studio 2003.
• The library is now licensed under GPL v2 or v3 (you have the choice) with special exceptions allowing to link against LP-solver libraries.

Please refer to the change-log for further details.

The first hotfix v.2007.09_a for Jacaranda has been released and is available at the download page. It fixes a bug that occurs when using OGDF with Coin.

The first public release of OGDF (v.2007.09, Codename “Jacaranda”) goes online, including this website, forum, and doxygen-documentation.

w