Graph Drawing Contest 1996
Vladimir Batagelj and Andrej Mrvar
University of Ljubljana, Slovenia
Last change: 8. September 1996
Data and rules
See the page
GD96 Graph-Drawing Contest or its
mirror in Passau and
GD96 Graph-Drawing Conference.
See also our layouts for Graph-Drawing Contests:
How layouts of graphs were obtained
- Graph B
- Automatically obtained layout using our program COORD.
(positioning vertices on the rectangular net so that the number
of crossings of lines is as low as possible).
- Manual editing to reposition vertices using our graph picture
- Graph C
- Analysing graph C using our program RELCALC two parts
were found and 2 connecting vertices.
- Each part was handled separately using our program ENERG
(minimisation of energy). One part consists of a lattice structure,
and the second of a planar graph of cylindric symmetries.
This spatial picture was realized in VRML (see also its
our graph description language
NetML based on SGML).
- Some manual editing for planar representation.
- Graph D
- Analysing graph D using program RELCALC 17 important vertices of "kernel graph"
- Automatically obtained layout for these 17 vertices using program COORD.
- Other vertices were added to the picture obtained.
- Some manual editing using DRAW to reposition vertices to avoid crossings.
- Graph B:
- Graph C:
VRML screen snapshot (GIF) C,
VRML (cylinder) screen snapshot (GIF) C,
VRML (cylinder) C.
- Graph D:
Department of Mathematics, University of Ljubljana
Andrej Mrvar, Faculty of Social Sciences, University of Ljubljana