Cognitive experiments show that humans can read graph drawings in which all edge crossings are at right angles equally well as they can read planar drawings; they also show that the readability of a drawing is heavily affected by the number of bends along the edges. A graph visualization whose edges can only cross perpendicularly is called a RAC (Right Angle Crossing) drawing. This paper initia...

An IC-plane graph is a topological graph where every edge is crossed at most once and no two crossed edges share a vertex. We show that every IC-plane graph has a visibility drawing where every vertex is of the form { , , , }, and every edge is either a horizontal or vertical segment. As a byproduct of our drawing technique, we prove that every IC-plane graph has a RAC drawing in quadratic area...

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 ].

Monotone Drawings of Graphs p. 13 Upward Geometric Graph Embeddings into Point Sets p. 25 On a Tree and a Path with No Geometric Simultaneous Embedding p. 38 Difference Map Readability for Dynamic Graphs p. 50 Maximizing the Total Resolution of Graphs p. 62 Plane Drawings of Queue and Deque Graphs p. 68 An Experimental Evaluation of Multilevel Layout Methods p. 80 Orthogonal Graph Drawing with ...

Plasma-catalytic ammonia synthesis in a dielectric barrier discharge reactor has emerged as possible route for electrification of nitrogen fixation. In this study, we use combination experiments and plasma kinetic model to investigate the from N2 H2, both with without solid packing material zone. The effect power, feed flow rate, N2:H2 ratio, gas residence time, temperature, (MgAl2O4 alone or i...