Graph Drawing Contest 2010
Graph Drawing is the art to place nodes and route links in a diagram fully automatically. As you know, the IBM ILOG Visualization Components contain plenty of layout algorithms for this task. Still, it is ongoing research, as there are every year new inventions that improve the layout quality or that apply graph drawing technology to new domains. IBM participates actively in the research community. We hope to get here inspiration for further developments within our own components.
It is time again for the 17th Graph Drawing Contest, held in conjunction with the GD'2010 conference in Konstanz on Sep 21-24. Like last year, 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, we have an exciting mystery graph: by looking at the topology of the graph, you have to figure out what this graph is. You also have to produce a nice layout of the graph. Every student of computer science should know this graph, even though it is not immediately obvious what the graph means. Another topic is edge or link routing: graphs with node positions are given and you have to route the links so that the result looks appropriate for the corresponding application domain. If you have a good algorithm for link routing, I invite you to try this challenge. The contest is open for everybody to submit results. Maybe you will be declared winner!
Additionally, there will again be an online contest similar to a programming contest. This year the challenge shall focus on minimizing 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. If you are interested in participating in the Graph Drawing Contest, you can find further information at http