Three-dimensional orthogonal graph drawing with optimal volume

Therese Biedl, Torsten Thiele, David R. Wood

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

13 Citations (Scopus)

Abstract

In this paper, we study three-dimensional orthogonal box- drawings of graphs without loops. We provide lower bounds for three scenarios: (1) drawings where vertices have bounded aspect ratio, (2) drawings where the surface of vertices is proportional to their degree, and (3) drawings without any such restrictions. Then we give construc- tions that match the lower bounds in all scenarios within an order of magnitude.

Original languageEnglish
Title of host publicationGraph Drawing - 8th International Symposium, GD 2000 ColonialWilliamsburg, VA, USA, September 20-23, 2000 Proceedings
PublisherSpringer-Verlag London Ltd.
Pages284-295
Number of pages12
ISBN (Print)3540415548, 9783540415541
DOIs
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
https://link.springer.com/book/10.1007/3-540-44541-2 (Proceedings)

Publication series

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

Conference

ConferenceGraph Drawing 2000
Abbreviated titleGD 2000
CountryUnited States of America
CityColonial Williamsburg
Period20/09/0023/09/00
Internet address

Cite this