Abstract
We present, two algorithms for orthogonal graph drawing in three dimensional space. For graphs of maximum degree six, the 3-D drawing is produced in linear time, has volume at most 4.66n8 and each edge has at most three bends. If the degree of the graph is arbitrary, the vertices are represented by solid 3-D boxes whose surface is proportional to their degree. The produced drawing has two bends per edge. Both algorithms guarantee no crossings and can be used under an interactive setting (i.e., vertices arrive and enter the drawing on-line), as well.
Cite
CITATION STYLE
Papakostas, A., & Tollis, I. G. (1997). Incremental orthogonal graph drawing in three dimensions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1353, pp. 52–63). Springer Verlag. https://doi.org/10.1007/3-540-63938-1_50
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
