Most of the work that appears in the two-dimensional 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. The orthogonal drawings produced by our algorithm have area at most (m-1) \(\times\) ( m / 2 +2) . Two important properties of our algorithm are that the drawings exhibit a small total number of bends (less than m ), and that there is at most one bend per edge.
This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
Received January 15, 1997; revised February 1, 1998.
About this article
Cite this article
Papakostas, A., Tollis, I. Efficient Orthogonal Drawings of High Degree Graphs . Algorithmica 26, 100–125 (2000). https://doi.org/10.1007/s004539910006
- Key words. Graph drawing, Orthogonal graph drawing, Algorithms, Information visualization, Graphical user interfaces.