Efficient Orthogonal Drawings of High Degree Graphs |
| |
Authors: | A. Papakostas I. G. Tollis |
| |
Affiliation: | (1) Network Management Division, NEC America, 1525 W. Walnut Hill Lane, Irving, TX 75038, USA. papakos@asl.dl.nec.com., US;(2) Department of Computer Science, The University of Texas at Dallas, Richardson, TX 75083-0688, USA. tollis@utdallas.edu., US |
| |
Abstract: | 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) ( 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. Received January 15, 1997; revised February 1, 1998. |
| |
Keywords: | . Graph drawing Orthogonal graph drawing Algorithms Information visualization Graphical user interfaces. |
本文献已被 SpringerLink 等数据库收录! |
|