1997 Graph Drawing Competition

lbrankov@cs.newcastle.edu.au (Ljiljana Brankovic)
29 Jul 1997 13:57:51 -0400

          From comp.compilers

Related articles
1997 Graph Drawing Competition lbrankov@cs.newcastle.edu.au (1997-07-29)
| List of all articles for this month |

From: lbrankov@cs.newcastle.edu.au (Ljiljana Brankovic)
Newsgroups: comp.compilers
Date: 29 Jul 1997 13:57:51 -0400
Organization: The University of Newcastle
Keywords: CFP, graphics

Graph-Drawing Contest 1997

The fourth annual graph-drawing contest is now open. The idea of the
contest is simple: adjacency lists and attribute of three graphs are
available via ftp. The challenge is to create good visualizations of
these graphs. Reports of the previous graph-drawing contests can be
found in Springer Lecture Notes in Computer Science Volumes 894, 1027,
and 1190.

This year features one artificial graph designed specifically to
challenge orthogonal graph-drawing algorithms, and two graphs with
real-world data.

Winning entries for each graph will be chosen by a panel of experts.
A prize fund of $750 (U.S.) is anticipated. As usual, the winning
entries will be described in the proceedings of the Graph Drawing

The three graphs, rules, and further information about the
contest is available from
The deadline for entries is midnight, September 10, 1997.
(Note: This is a hard deadline.)

Entries, and enquiries about the contest, should be sent to
Joe Marks
201 Broadway
Cambridge, MA 02139
Phone: 617-621-7534
Email marks@merl.com.

The judging and presentation of the awards will be held in conjunction
with GRAPH DRAWING '97 (Rome, September 18-20, 1997; see
http://www.inf.uniroma3.it/calendar/gd97). However, attendance at the
conference is not a prerequisite for participation in the contest.

Corporate Sponsors MERL --- A Mitsubishi Electric Research Laboratory,
AT&T Laboratories, and others to be announced.

Organizers: Peter Eades, Joe Marks, and Stephen North.

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.