Skip to main content
Conference Proceedings

Computing proximity drawings of trees in the 3-dimensional space

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1995) 955 249-250
DOI: 10.1007/3-540-60220-8_66
23Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Representing a graph in the 3-dimensional space is one of the most recent and challenging research issues for the graph drawing community. We deal with 3-dimensional proximity drawings of trees. We provide combinatorial characterizations of the classes of representable graphs and present several drawing algorithms.

Cite

CITATION STYLE

APA

Liotta, G., & Di Battista, G. (1995). Computing proximity drawings of trees in the 3-dimensional space. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 955, pp. 249–250). Springer Verlag. https://doi.org/10.1007/3-540-60220-8_66

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