Orthogonal 3D shapes of theta graphs

3Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The recent interest in three dimensional graph drawing has been motivating studies on how to extend two dimensional techniques to higher dimensions. A common approach for computing a 2D orthogonal drawing ofa graph separates the task ofdefining the shape of the drawing from the task of computing its coordinates. First results towards finding a three-dimensional counterpart ofthis approach are presented in [8,9], where characterizations oforthogonal representations ofpaths and cycles are studied. In this note we show that the known characterization for cycles does not immediately extend to even seemingly simple graphs such as theta graphs. A sufficient condition for recognizing three-dimensional orthogonal representations of theta graphs is also presented. © Springer-Verlag Berlin Heidelberg 2002.

Cite

CITATION STYLE

APA

Di Giacomo, E., Liotta, G., & Patrignani, M. (2002). Orthogonal 3D shapes of theta graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2528 LNCS, pp. 142–149). Springer Verlag. https://doi.org/10.1007/3-540-36151-0_14

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