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.
Computing Proximity Drawings of Trees in the 3-Dimensional Space
LIOTTA, Giuseppe;
1995
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.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
