Skip to main content
Log in

Efficient Orthogonal Drawings of High Degree Graphs

  • Published:
Algorithmica Aims and scope Submit manuscript

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) \(\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 via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received January 15, 1997; revised February 1, 1998.

Rights and permissions

Reprints and permissions

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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s004539910006

Navigation