This report describes the Fourth Annual Graph Drawing Contest, held in conjunction with the 1997 Graph Drawing Symposium in Rome, Italy. The purpose of the contest is to monitor and challenge the current state of the art in graph-drawing technology [2, 3, 4]. This work may not be copied or reproduced in whole or in part for any commercial purpose. Permission to copy in whole or in part without ...

Let R and B be two disjoint sets of points in the plane such that |B| 6 |R|, and no three points of R ∪ B are collinear. We show that the geometric complete bipartite graph K(R,B) contains a non-crossing spanning tree whose maximum degree is at most max { 3, ⌈ |R|−1 |B| ⌉ + 1 } ; this is the best possible upper bound on the maximum degree. This solves an open problem posed by Abellanas et al. a...

We show that there exist triangulations that do not admit any planar straight-line drawing in which every face is an isosceles triangle, thus partially solving a question posed in [Demaine, Mitchell, O’Rourke – The Open Problems Project ].

Symmetry is one of the most important aesthetic criteria in graph drawing because it reveals structure in the graph. To draw graphs symmetrically, we employ two steps. The first step is to find appropriate automorphisms. The second step is to draw the graph to display the automorphisms. Our aim in this paper is to construct maximally symmetric straight line drawings of triconnected planar graph...

A k-track drawing is a crossing-free 3D straight-line drawing of a graph G on a set of k parallel lines called tracks. The minimum value of k for which G admits a k-track drawing is called the track number of G. In [18] it is proved that every graph from a proper minor closed family has constant track number if and only if it has constant queue number. In this paper we study the track number of...

Clustered graph is a very useful model for drawing large and complex networks. This paper presents a new method for drawing clustered graphs in three dimensions. The method uses a divide and conquer approach. More specifically, it draws each cluster in a 2D plane to minimise occlusion and ease navigation. Then a 3D drawing of the whole graph is constructed by combining these 2D drawings. Our ma...

Artistic drawing is one of the disciplines fine arts; it art embellishing our spaces; a means for artist to express his thoughts and medium he uses provide viewer with reading society. The finds in an indispensable mode expression. Let us specify that “thought”, concept we refer this dissertation, concerns only artist’s intentions, vision world, interpretation social realities. Knowing expressi...

We address the problem of drawing hypergraphs. We propose and evaluate a family of algorithms that transform a hypergraph drawing problem into a graph drawing problem. Each algorithm in the family relies on a different encoding of a hyperedge into a set of edges. The algorithms can then use any graph drawing algorithms. However, we here focus on the force-directed algorithms. We propose and dis...