Refinement of three-dimensional orthogonal graph drawings

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

doi:10.1007/3-540-44541-2_29

Refinement of three-dimensional orthogonal graph drawings

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

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

7 Citations (Scopus)

Abstract

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 language	English
Title of host publication	Graph Drawing - 8th International Symposium, GD 2000 ColonialWilliamsburg, VA, USA, September 20-23, 2000 Proceedings
Publisher	Springer-Verlag London Ltd.
Pages	308-320
Number of pages	13
ISBN (Print)	3540415548, 9783540415541
DOIs	https://doi.org/10.1007/3-540-44541-2_29
Publication status	Published - 1 Jan 2001
Externally published	Yes
Event	Graph Drawing 2000 - Colonial Williamsburg, United States of America Duration: 20 Sept 2000 → 23 Sept 2000 Conference number: 8th https://link.springer.com/book/10.1007/3-540-44541-2 (Proceedings)

Publication series

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

Conference

Conference	Graph Drawing 2000
Abbreviated title	GD 2000
Country/Territory	United States of America
City	Colonial Williamsburg
Period	20/09/00 → 23/09/00
Internet address	https://link.springer.com/book/10.1007/3-540-44541-2 (Proceedings)

Access to Document

10.1007/3-540-44541-2_29

Cite this

Lynn, B. Y. S., Symvonis, A., & Wood, D. R. (2001). Refinement of three-dimensional orthogonal graph drawings. In Graph Drawing - 8th International Symposium, GD 2000 ColonialWilliamsburg, VA, USA, September 20-23, 2000 Proceedings (pp. 308-320). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1984). Springer-Verlag London Ltd.. https://doi.org/10.1007/3-540-44541-2_29

Lynn, Benjamin Y.S. ; Symvonis, Antonios ; Wood, David R. / Refinement of three-dimensional orthogonal graph drawings. Graph Drawing - 8th International Symposium, GD 2000 ColonialWilliamsburg, VA, USA, September 20-23, 2000 Proceedings. Springer-Verlag London Ltd., 2001. pp. 308-320 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{764d308f3a144bc7b9e775a01b54f72e,

title = "Refinement of three-dimensional orthogonal graph drawings",

abstract = "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.",

author = "Lynn, {Benjamin Y.S.} and Antonios Symvonis and Wood, {David R.}",

year = "2001",

month = jan,

day = "1",

doi = "10.1007/3-540-44541-2_29",

language = "English",

isbn = "3540415548",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer-Verlag London Ltd.",

pages = "308--320",

booktitle = "Graph Drawing - 8th International Symposium, GD 2000 ColonialWilliamsburg, VA, USA, September 20-23, 2000 Proceedings",

address = "Germany",

note = "Graph Drawing 2000, GD 2000 ; Conference date: 20-09-2000 Through 23-09-2000",

url = "https://link.springer.com/book/10.1007/3-540-44541-2",

}

Lynn, BYS, Symvonis, A & Wood, DR 2001, Refinement of three-dimensional orthogonal graph drawings. in Graph Drawing - 8th International Symposium, GD 2000 ColonialWilliamsburg, VA, USA, September 20-23, 2000 Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1984, Springer-Verlag London Ltd., pp. 308-320, Graph Drawing 2000, Colonial Williamsburg, Virginia, United States of America, 20/09/00. https://doi.org/10.1007/3-540-44541-2_29

Refinement of three-dimensional orthogonal graph drawings. / Lynn, Benjamin Y.S.; Symvonis, Antonios; Wood, David R.
Graph Drawing - 8th International Symposium, GD 2000 ColonialWilliamsburg, VA, USA, September 20-23, 2000 Proceedings. Springer-Verlag London Ltd., 2001. p. 308-320 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1984).

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

TY - GEN

T1 - Refinement of three-dimensional orthogonal graph drawings

AU - Lynn, Benjamin Y.S.

AU - Symvonis, Antonios

AU - Wood, David R.

N1 - Conference code: 8th

PY - 2001/1/1

Y1 - 2001/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0012782377&partnerID=8YFLogxK

U2 - 10.1007/3-540-44541-2_29

DO - 10.1007/3-540-44541-2_29

M3 - Conference Paper

AN - SCOPUS:0012782377

SN - 3540415548

SN - 9783540415541

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 308

EP - 320

BT - Graph Drawing - 8th International Symposium, GD 2000 ColonialWilliamsburg, VA, USA, September 20-23, 2000 Proceedings

PB - Springer-Verlag London Ltd.

T2 - Graph Drawing 2000

Y2 - 20 September 2000 through 23 September 2000

ER -

Lynn BYS, Symvonis A, Wood DR. Refinement of three-dimensional orthogonal graph drawings. In Graph Drawing - 8th International Symposium, GD 2000 ColonialWilliamsburg, VA, USA, September 20-23, 2000 Proceedings. Springer-Verlag London Ltd. 2001. p. 308-320. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-44541-2_29

Refinement of three-dimensional orthogonal graph drawings

Abstract

Publication series

Conference

Access to Document

Other files and links

Cite this