Orthogonal drawing of high degree graphs with small area and few bends

Abstract

Most of the work that appears in the orthogonal graph drawing literature deals with graphs whose maximum degree is four. In this paper we present an algorithm for orthogonal drawings of simple graphs with degree higher than four. Vertices are represented by rectangular boxes of perimeter less than twice the degree of the vertex. Our algorithm is based on creating groups/pairs of vertices of the graph both ahead of time and in real drawing time. The orthogonal drawings produced by our algorithm have area at most (m−1) × \(\left( {\frac{m}{2} + 2} \right)\). Two important properties of our algorithm are that the drawings exhibit small total number of bends (less than m), and that there is at most one bend per edge.