[Compgeom-announce] Call for Participation: 13th Annual Graph Drawing Contest

[Christian Duncan <duncan@latech.edu>]

               Call for Participation
             Graph Drawing Contest '06
        September 18 - 20, 2006, Karlsruhe, Germany
             http://gd2006.org/contest/

The 13th Annual Graph Drawing Contest shall be held in conjunction
with the 14th International Symposium on Graph Drawing (GD 2006).
Except for the challenge competition, which takes place during the
conference, all submissions are due by September 15, 2006.  The
anticipated funding for the contest is EUR1,000.

------------------
Category Overviews
------------------
This year, the contest has five graph categories.  Details on each can
be found at the contest web site, mentioned above.  The following is a
brief description of each of the categories:

* Free-Style Competition:
 The free-style competition is an opportunity for participants to
 present their best graph visualizations.  All types of graph
 drawings can be submitted to this contest, and judging will be based
 on artistic merit and relevance to the graph drawing community.

* Theoretical Graph:
 The theoretical graph is a "mystery" graph of 101 nodes and 190
 edges.

* History of the Cup Graph:
 For this category, we simply provide data representing all the games
 played throughout the history of the FIFA World Cup Finals.  The
 task is to visualize the tournaments played over the years as an
 evolving graph.

* Java (Compile-Time) Dependency Graph:
 The Java (Compile-Time) Dependency graph consists of nodes
 representing Java classes and directed edges representing
 (compile-time) dependencies between two classes.

* Graph Drawing Challenge:
 The challenge will be held during the conference in a format similar
 to a typical programming contest, where teams are presented with a
 collection of challenge-graphs and have approximately one hour to
 submit their highest scoring drawings.  This year the challenge
 shall focus on minimizing the area of straight-line grid drawings of
 planar graphs.

--------------------
Contest: Submissions
--------------------
Submissions for all categories, except for the Challenge, must be
received by midnight September 15 and should include the following
information:
* Names and email addresses of the contributors,
* A picture (or movie) illustrating the graph (graphs),
* A brief description of the graph, how it was generated, and its
 relevance to the problem or the graph drawing community.

If your drawing requires special printing because of size, resolution,
or color constraints, you are encouraged to submit via hard-copy.
Besides hard-copy submissions, acceptable electronic formats include
PDF and PostScript for static images. For dynamic graphs or animations
use mpg or avi files. Movies should be made with standard codecs.  All
contest submissions should be sent to
            Christian Duncan
            Computer Science Program
            P. O. Box 10348
            Louisiana Tech University
            Ruston, LA 71272, USA
            Christian.Duncan(at)acm.org

-------------------------------
Graph Drawing Contest Committee
-------------------------------
Christian A. Duncan (Chair), Louisiana Tech University
Gunnar Klau, Freie Universitaet Berlin
Stephen G. Kobourov, University of Arizona
Georg Sander, ILOG

Questions or comments should be sent to Christian Duncan,
christian.duncan(at)acm.org.

_______________________________________________
Compgeom-announce mailing list
Compgeom-announce@compgeom.poly.edu
http://compgeom.poly.edu/mailman/listinfo/compgeom-announce