Skip to main content
Conference ProceedingsOPEN ACCESS

Three-dimensional orthogonal graph drawing with optimal volume

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2001) 1984 284-295
DOI: 10.1007/3-540-44541-2_27
13Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Cite

CITATION STYLE

APA

Biedl, T., Thiele, T., & Wood, D. R. (2001). Three-dimensional orthogonal graph drawing with optimal volume. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1984, pp. 284–295). Springer Verlag. https://doi.org/10.1007/3-540-44541-2_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free