The Community for Technology Leaders
Visualization Symposium, IEEE Pacific (2014)
Yokohama, Japan Japan
Mar. 4, 2014 to Mar. 7, 2014
pp: 233-237
Ragaad AlTarawneh , Comput. Graphics & HCI Group, Univ. of Kaiserslautern, Kaiserslautern, Germany
Johannes Schultz , Comput. Graphics & HCI Group, Univ. of Kaiserslautern, Kaiserslautern, Germany
Shah Rukh Humayoun , Comput. Graphics & HCI Group, Univ. of Kaiserslautern, Kaiserslautern, Germany
ABSTRACT
In this paper, we present an algorithm, called CluE (The Cluster Expander of Compound Graphs), that expands cluster nodes in compound graphs. CluE was designed to work with multiple layout algorithms (e.g., orthogonal layout algorithm, Sugyima layout algorithm, etc.). It keeps the unexpanded nodes in their relative layers with slight changes in their original coordination. This helps the users in maintaining their mental map of the underlying graph. We applied the proposed algorithm for navigating through compound graphs representing the failure mechanisms in embedded systems. We also performed a brief user evaluation study in order to measure the users' acceptance level with regard to the application of CluE for compound graphs. Results show a high acceptance ratio from users having different backgrounds, which indicates the intuitiveness and feasibility of our approach.
INDEX TERMS
Clustering algorithms, Layout, Compounds, Safety, Algorithm design and analysis, Navigation, Visualization,clustered graphs exploration, Information visualization, graphs and networks, compound graphs visualization
CITATION
Ragaad AlTarawneh, Johannes Schultz, Shah Rukh Humayoun, "CluE: An Algorithm for Expanding Clustered Graphs", Visualization Symposium, IEEE Pacific, vol. 00, no. , pp. 233-237, 2014, doi:10.1109/PacificVis.2014.18
220 ms
(Ver 3.3 (11022016))