11th Annual Graph Drawing Contest
GD 2004 Challenge Graphs
- Download the challenge graphs: challenge.zip
- Email submissions to kobourov@cs.arizona.edu by 8:00pm EST, Sept 29.
- Include the following information in your email:
- Names and affiliation of contestants
- Method used: program (which one?), manual, combination (percentage manual?)
- Zipped file of your graphs
GD 2004 Contest Rules
The graph drawing contest has two distinct tracks: the graph drawing challenge and the freestyle contest. To view the detailed rules for the GD 2004 Graph Drawing Contest, please click here.
Here is a brief overview of the graph drawing challenge:
- The graph drawing challenge will take place on September 29th at the
conclusion of the afternoon session.
- The challenge graphs will be announced at 6:30pm and submissions will be due by email by 7:30pm.
- This year's challenge will be crossing minimization.
- Teams of one to three participants will be allowed.
- Teams may bring their own software and computers for the challenge.
- Lab space and a simple graph editor will be provided for teams that did not bring computers/software.
- The graph editor program is available for download (Linux: GraphMan-0.6.tgz and Windows GraphMan.jar ). See the About GraphMan webpage for overview of the
program.
Graph Format
For the GD2004 contest, we will use a modified ASCII format described below. The contest graphs will be provided in this format and the submission should be prepared using the same format.
Sample File
Below is a simple example:
-----------------------------------------------------------------
# Lines starting with # are comments and ignored
# First value is NumNodes(N)
4
# Next N pairs are X,Y (double) coordinate values of each node 0,1, N-1
0.0 0.0 # Node 0
0.0 5.0 # Node 1
5.0 5.0 # Node 2
5.0 0.0 # Node 4
# Remaining pairs of INTEGER values are undirected edges Ns, Ne
0 1 # Edge from Node 0 to Node 1
0 2
0 3
1 2
1 3
2 3
# Here we defined a 4-clique (with 1 crossing)
-----------------------------------------------------------------
Additional sample files can be found here:
Contact
Stephen Kobourov
http://www.cs.arizona.edu/~kobourov