3DCube's Main Page
What is 3DCube?
3DCube (3D Diagram Drawer) is a general
frame for the three-dimesional representation of graphs, especially devoted
to the algorithms evaluation, refinement and developement. It offers innovative
features in the user interaction and contains a set of three-dimesional
algorithms both taken from the literature and proposed by the authors.
How is it implemented?
The first version of the tool was developed in C++ language, on a UNIX
RISC 6000 workstation, using the Motif libraries for the management of
the windows environment and the graPHIGS libraries for the three-dimensional
A new version of the graphic driver of 3DCube which will use the OpenGL
graphic library is under implementation.
Currently a CGI demo version of the tool is available, yielding a VRML
2.0 description of the diagram produced.
Who developed 3DCube?
algorithms 3DCube supports?
The set of implemented algorithms comprehends:
the algorithm proposed by Therese Biedl in [BIEDL95]
the Kolmogorov and Bardzin algorithm revised by P. Eades, C. Stirk and
S. Whitesides in [EADES95]
the Compact algorithm proposed in [EADES96]
the Three Bends algorithm proposed in [EADES96]
the algorithm proposed by Papakostas in [PAPA96]
the Momentum Curve algorithm proposed in [COHEN94]
and some other algorithms proposed by the authors.
Some snapshots of 3DCube (GIF files)
Other 3D-related projects of our Research Group
IN3DNET is a new proposal for a three
dimensional navigation system for HTML pages, developed by Marco Sbarrini and Valerio Violi.
Biedl. Heuristics for 3D-Orthogonal Graph Drawing. Presented al
the 4th Twente Workshop, Enschende, June 1995. http://rutcor.rutgers.edu/~therese/ps/3D.twente.ps
Cohen, P. Eades,
T. Lin and F. Ruskey. Three-dimensional graph drawing. Proc. GD '94,
Lecture Notes in Computer Science 894, pp. 1-11, 1994.
Eades, C. Stirk and S. Whitesides. The Techniques of Komolgorov and
Bardzin for Three Dimensional Orthogonal Graph Drawing. TR 95-07, Dept.
of Computer Science, University of Newcastle NSW, Australia, October
Eades, A. Symvonis and S. Whitesides. Two Algorithms for Three Dimensional
Orthogonal Graph Drawing. Proc. GD '96, Lecture Notes in Computer
Science 1190, pp. 139-154, Springer-Verlag, 1996.
[PAPA96] A. Papakostas. Information Visualization:
Orthogonal Drawings of Graphs. PhD. thesis, Department of Computer
Science, University of Texas at Dallas, December 1996.
[PAPA97] A. Papakostas and I.G.
Tollis, Incremental Orthogonal Graph Drawing in Three Dimensions, Technical
Report UTDCS-02-97, The University of Texas at Dallas, 1997. http://www.utdallas.edu/~tollis/papers/incremental3D.ps
Please send feedback on this page to email@example.com