Graph Drawing Contest 2011
One of the key features of IBM ILOG Visualization Components is the automatic graph layout, the calculation of arrangements for nodes and links in the plane so that the diagram looks nice. This is a mathematical research topic, since every year, new algorithms are invented that are either faster, or produce better results, or apply the mathematical theory to a new application domain. Our team participates actively in that research community, since the IBM ILOG Visualization Components should remain state of the art.
It is time again for the 18th Graph Drawing Contest, held in conjunction with the GD 2011 conference in Eindhoven on Sep 21-23. Like in recent years, I have the pleasure to be a member of the contest committee, and I am excited to soon see the results of the challenges. This year, the topic of the contest is Angular Resolution: how to create a drawing so that the angles of links at nodes and at link crossings are large. If those angles are too small, it is difficult to recognize the link flow visually. The contest graphs can be found at the graph drawing contest website. You have to produce a nice layout of the graph. The contest is open for everybody to submit results. The winners are announced during the GD 2011 conference. I invite you to try the graphs with IBM ILOG Visualization software. Maybe you will be declared winner!
Additionally, there will again be an online contest similar to a programming contest. We have the tradition to use the same topic for the online contest in two subsequent years, because creating and optimizing tools for an online contest is a large effort. Hence, this year the challenge is like in 2010 to minimize the length of the longest edge in an orthogonal layout. The longest edge can be a bottleneck for many applications, hence minimizing its length is important. The online contest must be solved online within 1 hour. The contest graphs will of course be different than last year. If you are interested in participating in the Graph Drawing Contest, you can find further information at http