Layered drawings of directed graphs in three dimensions Export

@misc{citeulike:2802110, abstract = {We introduce a new graph drawing convention for 3D layered drawings of directed graphs. The vertex set is partitioned into layers with all edges pointing in the same direction. The layers occupy parallel planes and vertices in each layer occupy two parallel lines. Thus, the traditional 2D layered drawing of a directed graph is split into two vertical walls each containing a 2D layered drawing. We outline a technique for 3D layered digraph drawing which is an extension to the well-known Sugiyama ...}, author = {Hong, S. and Nikolov, N.}, citeulike-article-id = {2802110}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.59.1486}, keywords = {3d, graph\_layout, network, visualization}, posted-at = {2008-05-15 17:35:25}, priority = {2}, title = {Layered drawings of directed graphs in three dimensions}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.59.1486}, year = {2005} }

TY - GEN ID - citeulike:2802110 L3 - citeulike-article-id:2802110 N2 - We introduce a new graph drawing convention for 3D layered drawings of directed graphs. The vertex set is partitioned into layers with all edges pointing in the same direction. The layers occupy parallel planes and vertices in each layer occupy two parallel lines. Thus, the traditional 2D layered drawing of a directed graph is split into two vertical walls each containing a 2D layered drawing. We outline a technique for 3D layered digraph drawing which is an extension to the well-known Sugiyama ... TI - Layered drawings of directed graphs in three dimensions KW - 3d KW - graph_layout KW - network KW - visualization AU - Hong, S AU - Nikolov, N PY - 2005/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.59.1486 ER -