Cited By
View all- Lhuillier AHurter CTelea A(2017)State of the Art in Edge and Trail Bundling TechniquesComputer Graphics Forum10.1111/cgf.1321336:3(619-645)Online publication date: 1-Jun-2017
Interactive 3D Force-Directed Edge Bundling
Pages 51 - 60
Abstract
Interactive analysis of 3D relational data is challenging. A common way of representing such data are node-link diagrams as they support analysts in achieving a mental model of the data. However, naïve 3D depictions of complex graphs tend to be visually cluttered, even more than in a 2D layout. This makes graph exploration and data analysis less efficient. This problem can be addressed by edge bundling. We introduce a 3D cluster-based edge bundling algorithm that is inspired by the force-directed edge bundling FDEB algorithm [HvW09b] and fulfills the requirements to be embedded in an interactive framework for spatial data analysis. It is parallelized and scales with the size of the graph regarding the runtime. Furthermore, it maintains the edge's model and thus supports rendering the graph in different structural styles. We demonstrate this with a graph originating from a simulation of the function of a macaque brain.
References
[1]
<label>{ABH*13}¿¿</label> Alper B., Bach B., Henry Riche N., Isenberg T., Fekete J.-D.: Weighted Graph Comparison Techniques for Brain Connectivity Analysis</otherTitle>. <otherTitle>Proc. Conference on Human Factors in Computing Systems 2013, pp.483-492. 1
[2]
<label>{BKSS90}¿¿</label> Beckmann N., Kriegel H., Schneider R., Seeger B.: The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles. Proc. ACM SIGMOD International Conference on Management of Data Volume 19 1990, pp.322-331. 3
[3]
<label>{Bon00}¿¿</label> Bondi A.B.: Characteristics of Scalability and Their Impact on Performance</otherTitle>. <otherTitle>Proc. ACM International Workshop on Software and Performance 2000, pp.195-203. 2, 8
[4]
<label>{BSJ*14}¿¿</label> Böttger J., Schurade R., Jakobsen E., Schäfer A., Margulies D.S.: Connexel Visualization: A Software Implementation of Glyphs and Edge-Bundling for Dense Connectivity Data Using BrainGL. Frontiers in Neuroscience Volume 8 2014, pp.15. 1, 2
[5]
<label>{BSL13}¿¿</label> Böttger J., Schäfer A., Lohmann G.: Three-Dimensional Mean-Shift Edge Bundling for the Visualization of Functional Connectivity in the Brain. IEEE TVCG Volume 20, Issue 3 2013, pp.471-480. 1, 2, 5
[6]
<label>{CNSD*92}¿¿</label> Cruz-Neira C., Sandin D.J., DeFanti T.A., Kenyon R.V., Hart J.C.: The CAVE: Audio Visual Experience Automatic Virtual Environment. Communications of the ACM Volume 35, Issue 6 1992, pp.64-72. 2
[7]
<label>{CZQ*08}¿¿</label> Cui W., Zhou H., Qu H., Wong P.C., Li X.: Geometry-Based Edge Clustering for Graph Visualization. IEEE TVCG Volume 14, Issue 6 2008, pp.1277-84. 2
[8]
<label>{EHP*11}¿¿</label> Ersoy O., Hurter C., Paulovich F.V., Cantareiro G., Telea A.: Skeleton-Based Edge Bundling for Graph Visualization. IEEE TVCG Volume 17, Issue 12 2011, pp.2364-73. 2
[9]
<label>{EKSX96}¿¿</label> Ester M., Kriegel H., Sander J., Xu X.: A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise</otherTitle>. <otherTitle>Proc. ACM Knowledge Discovery and Data Mining 1996, pp.226-231. 3, 4, 6
[10]
<label>{FR91}¿¿</label> Fruchterman T., Reingold E.: Graph Drawing by Force Directed Placement. Software - Practice and Experience Volume 21 1991, pp.1129-1164. 1
[11]
<label>{GD07}¿¿</label> Gewaltig M., Diesmann M.: NEST NEural Simulation Tool. Scholarpedia Volume 2, Issue 4 2007, pp.1430. 1, 8
[12]
<label>{GHNS11}¿¿</label> Gansner E.R., Hu Y., North S., Scheidegger C.: Multilevel Agglomerative Edge Bundling for Visualizing Large Graphs</otherTitle>. <otherTitle>Proc. IEEE Pacific Visualization Symposium 2011, pp.187-194. 3
[13]
<label>{GPL*13}¿¿</label> Gebhardt S., Pick S., Leithold F., Hentschel B., Kuhlen T.: Extended Pie Menus for Immersive Virtual Environments. IEEE TVCG Volume 19, Issue 4 2013, pp.644-51. 8
[14]
<label>{HET12}¿¿</label> Hurter C., Ersoy O., Telea A.: Graph Bundling by Kernel Density Estimation. Computer Graphics Forum Volume 31, Issue 3pt1 2012, pp.865-874. 2
[15]
<label>{Hol06}¿¿</label> Holten D.: Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data. IEEE TVCG Volume 12, Issue 5 2006, pp.741-8. 2
[16]
<label>{Hun58}¿¿</label> Hunter R.S.: Photoelectric Color Difference Meter. Journal of the Optical Society of America Volume 48, Issue 12 1958, pp.985. 8
[17]
<label>{HvW09a}¿¿</label> Holten D., van Wijk J.J.: A User Study on Visualizing Directed Edges in Graphs</otherTitle>. <otherTitle>Proc. International Conference on Human Factors in Computing Systems 2009, pp.2299-2308. 6
[18]
<label>{HvW09b}¿¿</label> Holten D., van Wijk J.J.: Force-Directed Edge Bundling for Graph Visualization. Computer Graphics Forum Volume 28, Issue 3 2009, pp.983-990. 1, 2, 3, 4, 5
[19]
<label>{LAM10}¿¿</label> Lambert A., Aubur D., Mélançon G.: Living Flows: Enhanced Exploration of Edge-Bundled Graphs Based on GPU-Intensive Edge Rendering</otherTitle>. <otherTitle>Proc. International Conference on Information Visualization 2010, pp.523-530. 7
[20]
<label>{LBA10a}¿¿</label> Lambert A., Bourqui R., Auber D.: 3D Edge Bundling for Geographical Data Visualization</otherTitle>. <otherTitle>Proc. International Conference Information Visualisation 2010, pp.329-335. 2
[21]
<label>{LBA10b}¿¿</label> Lambert A., Bourqui R., Auber D.: Winding Roads: Routing Edges into Bundles. Computer Graphics Forum Volume 29, Issue 3 2010, pp.853-862. 2
[22]
<label>{LLCM12}¿¿</label> Luo S.-J., Liu C.-L., Chen B.-Y., Ma K.-L.: Ambiguity-Free Edge-Bundling for Interactive Graph Visualization. IEEE TVCG Volume 18, Issue 5 2012, pp.810-21. 5
[23]
<label>{McL76}¿¿</label> MCLAREN K.: XIII-The Development of the CIE 1976 L* a* B* Uniform Colour Space and Colour-Difference Formula. Journal of the Society of Dyers and Colourists Volume 92 1976, pp.338-341. 8
[24]
<label>{Nie93}¿¿</label> Nielsen J.: Usability Engineering. Morgan Kaufmann Publishers Inc., 1993. 2
[25]
<label>{NSA*13}¿¿</label> Nowke C., Schmidt M., Albada S. J. V., Eppler J.M., Bakker R., Diesmann M., Hentschel B., Kuhlen T.: VisNEST - interactive Analysis of Neural Activity Data</otherTitle>. <otherTitle>Proc. IEEE Symposium on Biological Data Visualization 2013, pp.65-72. 8
[26]
<label>{PNBH11}¿¿</label> Pupyrev S., Nachmanson L., Bereg S., Holroyd A.: Edge Routing with Ordered Bundles</otherTitle>. <otherTitle>Proc. International Conference on Graph Drawing 2011, pp.136-147. 2, 6
[27]
<label>{PX05}¿¿</label> Phan D., Xiao L.: Flow Map Layout</otherTitle>. <otherTitle>Proc. IEEE InfoVis 2005, pp.219-224. 2
[28]
<label>{SHH11}¿¿</label> Selassie D., Heller B., Heer J.: Divided Edge Bundling for Directional Network Data. IEEE TVCG Volume 17, Issue 12 2011, pp.2354-63. 2, 8
[29]
<label>{TE10}¿¿</label> Telea A., Ersoy O.: Image-Based Edge Bundles: Simplified Visualization of Large Graphs. Computer Graphics Forum Volume 29, Issue 3 2010, pp.843-852. 2
[30]
<label>{WC07}¿¿</label> Wong N., Carpendale S.: Supporting Interactive Graph Exploration Using Edge Plucking. Visualization and Data Analysis Volume 6495 2007. 2
[31]
<label>{WCG03}¿¿</label> Wong N., Carpendale S., Greenberg S.: EdgeLens: An Interactive Method for Managing Edge Congestion in Graphs. Proc. IEEE InfoVis Volume 2003 2003, pp.51-58. 2
[32]
<label>{WM08}¿¿</label> Ware C., Mitchell P.: Visualizing Graphs in Three Dimensions. ACM Transactions on Applied Perception Volume 5, Issue 1 2008, pp.1-15. 1, 2
[33]
<label>{ZBDS12}¿¿</label> Zinsmaier M., Brandes U., Deussen O., Strobelt H.: Interactive Level-of-Detail Rendering of Large Graphs. IEEE TVCG Volume 18, Issue 12 2012, pp.2486-2495. 6
[34]
<label>{ZWHK14}¿¿</label> Zielasko D., Weyers B., Hentschel B., Kuhlen T.W.: interactive 3D Force-Directed Edge Bundling on Clustered Edges</otherTitle>. <otherTitle>In Poster Abstracts of IEEE InfoVis 2014. 2
Index Terms
- Interactive 3D Force-Directed Edge Bundling
Recommendations
Force-directed edge bundling for graph visualization
EuroVis'09: Proceedings of the 11th Eurographics / IEEE - VGTC conference on VisualizationGraphs depicted as node-link diagrams are widely used to show relationships between entities. However, nodelink diagrams comprised of a large number of nodes and edges often suffer from visual clutter. The use of edge bundling remedies this and reveals ...
Divided Edge Bundling for Directional Network Data
The node-link diagram is an intuitive and venerable way to depict a graph. To reduce clutter and improve the readability of node-link views, Holten & van Wijk's force-directed edge bundling employs a physical simulation to spatially group graph edges. ...
Ambiguity-Free Edge-Bundling for Interactive Graph Visualization
Graph visualization has been widely used to understand and present both global structural and local adjacency information in relational data sets (e.g., transportation networks, citation networks, or social networks). Graphs with dense edges, however, ...
Comments
Information & Contributors
Information
Published In
Publisher
The Eurographs Association & John Wiley & Sons, Ltd.
Chichester, United Kingdom
Publication History
Published: 01 June 2016
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 03 Feb 2025
Other Metrics
Citations
Cited By
View all- Lhuillier AHurter CTelea A(2017)State of the Art in Edge and Trail Bundling TechniquesComputer Graphics Forum10.1111/cgf.1321336:3(619-645)Online publication date: 1-Jun-2017