3DCube's Main Page
Index
What is 3DCube?
3DCube (3D Diagram Drawer) is a general
frame for the threedimesional 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 threedimesional
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 threedimensional
visualization.

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?
Which
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]
and [PAPA97]

the Momentum Curve algorithm proposed in [COHEN94]

and some other algorithms proposed by the authors.
Some snapshots of 3DCube (GIF files)
Other 3Drelated 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.
References
[BIEDL95] T.C.
Biedl. Heuristics for 3DOrthogonal Graph Drawing. Presented al
the 4th Twente Workshop, Enschende, June 1995. http://rutcor.rutgers.edu/~therese/ps/3D.twente.ps
[COHEN94] R.F.
Cohen, P. Eades,
T. Lin and F. Ruskey. Threedimensional graph drawing. Proc. GD '94,
Lecture Notes in Computer Science 894, pp. 111, 1994.
[EADES95] P.
Eades, C. Stirk and S. Whitesides. The Techniques of Komolgorov and
Bardzin for Three Dimensional Orthogonal Graph Drawing. TR 9507, Dept.
of Computer Science, University of Newcastle NSW, Australia, October
1995. ftp://ftp.cs.newcastle.edu.au/pub/techreports/tr9507.ps.Z
[EADES96] P.
Eades, A. Symvonis and S. Whitesides. Two Algorithms for Three Dimensional
Orthogonal Graph Drawing. Proc. GD '96, Lecture Notes in Computer
Science 1190, pp. 139154, SpringerVerlag, 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 UTDCS0297, The University of Texas at Dallas, 1997. http://www.utdallas.edu/~tollis/papers/incremental3D.ps
Please send feedback on this page to patrigna@dia.uniroma3.it