The document presents the Radius Degree Layout (RDL) algorithm for effective visualization of large graphs, highlighting its efficiency in illustrating social networks and anomalies. Various visualization enhancements, including 2D and 3D options, and modifications for tree visualizations are discussed. The conclusion emphasizes the algorithm's speed and potential for future modifications and applications.

1. ŽILNSKÁ UNIVERZITA V ŽILINE
Univerzitný vedecký park
UNIVERSITY OF ZILINA
University Science Park
Radius Degree Layout –
Fast and Easy Graph Visualization
Layout
Ing. Ľuboš Takáč, PhD.
11.07.2014

2. UNIVERSITYOFZILINA
UniversitySciencePark
Presentation Content
 Motivation
 Radius Degree Layout (RDL)
 RDL for Large Graphs
 Other RDL Options
 Conclusion & Future Work

3. UNIVERSITYOFZILINA
UniversitySciencePark
Motivation
 Visualization of large graphs (social networks, FOAF, DNA)
 Orientation in graphs, find important parts and anomalies
 Identification of graph type (only from the view)

4. UNIVERSITYOFZILINA
UniversitySciencePark
Radius Degree Layout (RDL)
 Simple and fast algorithm
 Place all the nodes into a circle with distance from the
center inverse proportional to the node degree
(neighbors count) of each node.
 Basic position on the circle is random

5. UNIVERSITYOFZILINA
UniversitySciencePark
Radius Degree Layout (RDL)

6. UNIVERSITYOFZILINA
UniversitySciencePark
RDL for Large Graphs
 alpha compositing

7. UNIVERSITYOFZILINA
UniversitySciencePark
Other RDL Options
 Placing proportional / inverse proportional
 Use no only linearly proportion (logarithmically, custom,…)
 3D visualization – use sphere instead of circle
 Choose another measurable attribute (metric) of node
 Improving by Force Directed Layout

8. UNIVERSITYOFZILINA
UniversitySciencePark
Proportional vs Inverse Prop.

9. UNIVERSITYOFZILINA
UniversitySciencePark
2D vs 3D Visualization

10. UNIVERSITYOFZILINA
UniversitySciencePark
2D vs 3D Visualization

11. UNIVERSITYOFZILINA
UniversitySciencePark
Enhanced with FDL
 Used Force Directed Layout where the distance from the center
is fixed

12. UNIVERSITYOFZILINA
UniversitySciencePark
Enhanced with FDL

13. UNIVERSITYOFZILINA
UniversitySciencePark
Enhanced with FDL
 Tree visualizations
 On surface (fixed distance to center)
 Attribute = depth of node

14. UNIVERSITYOFZILINA
UniversitySciencePark
Enhanced with FDL

15. UNIVERSITYOFZILINA
UniversitySciencePark
Enhanced with FDL

16. UNIVERSITYOFZILINA
UniversitySciencePark
Conclusion & Future Work
 Fast and easy graph layout algorithm
 Orientation in scale free graphs
 Quickly determination of graph type
 2D & 3D visualization
 Modification with FDL layout (no so fast as basic)
 Tree visualisation

17. UNIVERSITY OF ZILINA
University Science Park
Univerzitná 8215/1, 010 26 Žilina
ITMS 26220220184
Thank you for your attention.
This presentation is the result of the project implementation: University research park of the University of Zilina (ITMS: 26220220184)
supported by the Research & Development Operational Programme funded by the European Reagional Development Fund.
Ing. Ľuboš Takáč, PhD.
lubos.takac@uniza.sk