Refinement of three-dimensional orthogonal graph drawings

Benjamin Y.S. Lynn, Antonios Symvonis, David R. Wood

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

6 Citations (Scopus)


In this paper we introduce a number of techniques for the refinement of three-dimensional orthogonal drawings of maximum degree six graphs. We have implemented several existing algorithms for three-dimensional orthogonal graph drawing including a number of heuristics to improve their performance. The performance of the refinements on the produced drawings is then evaluated in an extensive experimental study. We measure the aesthetic criteria of the bounding box volume, the average and maximum number of bends per edge, and the average and maximum edge length. On the same set of graphs used in Di Battista et al. [3], our main refinement algorithm improves the above aesthetic criteria by 80%, 38%, 10%, 54% and 49%, respectively.

Original languageEnglish
Title of host publicationGraph Drawing - 8th International Symposium, GD 2000 ColonialWilliamsburg, VA, USA, September 20-23, 2000 Proceedings
PublisherSpringer-Verlag London Ltd.
Number of pages13
ISBN (Print)3540415548, 9783540415541
Publication statusPublished - 1 Jan 2001
Externally publishedYes
EventGraph Drawing 2000 - Colonial Williamsburg, United States of America
Duration: 20 Sep 200023 Sep 2000
Conference number: 8th (Proceedings)

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


ConferenceGraph Drawing 2000
Abbreviated titleGD 2000
Country/TerritoryUnited States of America
CityColonial Williamsburg
Internet address

Cite this