Advertisement

Multimedia Tools and Applications

, Volume 78, Issue 24, pp 35099–35118 | Cite as

Expectation-based 3D edge bundling

  • Guibing Yang
  • Kunle Ma
  • Xiaohui Yuan
  • Jie Li
  • Qiang LuEmail author
Article
  • 32 Downloads

Abstract

In the visualization of the node-link graph, it is common to use edge-bundling algorithms to reduce the visual clutter caused by the increase in nodes and connections while reflecting the high-level structure of the graph. However, the traditional force-directed edge-bundling method has unstable gravitation when applied in three dimensions. To address this issue, we propose an edge-bundling algorithm based on the expectation model, and the edge-bundling rules can be modularized to support the addition of calculation rules. The stability of the proposed method is improved. Our experimental results with 2D and 3D scenarios demonstrate that our algorithm produces superior results that unclutter complex graphs.

Keywords

Edge bundling Force-directed Expectation model 

Notes

Acknowledgments

This work was supported in part by the Natural Science Foundation of Anhui Province of China under Grant 1708085MF158, in part by the National Natural Science Foundation of China under Grant 61472115, in part by the Visiting Scholar Researcher Program at North Texas University through the State Scholarship Fund of the China Scholarship Council under Grant 201706695044, and in part by the Key Project of Transformation and Industrialization of Scientific and Technological Achievements of Intelligent Manufacturing Technology Research Institute of Hefei University of Technology under Grant IMICZ2017010.

References

  1. 1.
    Bondi AB (2000) Characteristics of scalability and their impact on performance. In: Proceedings of the 2nd international workshop on software and performance. ACM, pp 195–203Google Scholar
  2. 2.
    Böttger J, Schäfer A, Lohmann G, Villringer A, Margulies DS (2014) Three-dimensional mean-shift edge bundling for the visualization of functional connectivity in the brain. IEEE Trans Vis Comput Graph 20(3):471–480CrossRefGoogle Scholar
  3. 3.
    Cui W, Zhou H, Qu H, Wong PC, Li X (2008) Geometry-based edge clustering for graph visualization. IEEE Trans Vis Comput Graph 14(6):1277–1284CrossRefGoogle Scholar
  4. 4.
    Ersoy O, Hurter C, Paulovich F, Cantareiro G, Telea A (2011) Skeleton-based edge bundling for graph visualization. IEEE Trans Vis Comput Graph 17(12):2364–2373CrossRefGoogle Scholar
  5. 5.
    Herman I, Melan¸con G, Marshall MS (2000) Graph visualization and navigation in information visualization: a survey. IEEE Trans Vis Comput Graph 6(1):24–43CrossRefGoogle Scholar
  6. 6.
    Holten D (2006) Hierarchical edge bundles: visualization of adjacency relations in hierarchical data. IEEE Trans Vis Comput Graph 12(5):741–748CrossRefGoogle Scholar
  7. 7.
    Holten D, Van Wijk JJ (2009) Force-directed edge bundling for graph visualization. In: Computer graphics forum, vol 28. Wiley Online Library, pp 983–990Google Scholar
  8. 8.
    Hurter C, Ersoy O, Telea A (2012) Graph bundling by kernel density estimation. In: Computer graphics forum, vol 31. Wiley Online Library, pp 865–874Google Scholar
  9. 9.
    Lambert A, Bourqui R, Auber D (2010) 3d edge bundling for geographical data visualization. In: Information visualisation (IV), 2010 14th international conference. IEEE, pp 329–335Google Scholar
  10. 10.
    Lambert A, Bourqui R, Auber D (2010) Winding roads: routing edges into bundles. In: Computer graphics forum, vol 29. Wiley Online Library, pp 853–862Google Scholar
  11. 11.
    Lu Q, Kunle M (2016) Content importance based edge bundling for graph visualization. CAD&CG, 28(11):1899–1905Google Scholar
  12. 12.
    Moon TK (1996) The expectation-maximization algorithm. IEEE Signal Process Mag 13(6):47–60CrossRefGoogle Scholar
  13. 13.
    NASA: World wind (2006). URL https://worldwind.arc.nasa.gov/?root=java. Accessed Oct 2017
  14. 14.
    Pupyrev S, Nachmanson L, Bereg S, Holroyd AE (2011) Edge routing with ordered bundles. In: International symposium on graph drawing. Springer, pp 136–147Google Scholar
  15. 15.
    Telea A, Ersoy O (2010) Image-based edge bundles: simplified visualization of large graphs. In: Computer graphics forum, vol 29. Wiley Online Library, pp 843–852Google Scholar
  16. 16.
    The OpenFlights Database (2009). URL https://openflights.org/. Accessed Oct 2017
  17. 17.
    Ware C, Mitchell P (2008) Visualizing graphs in three dimensions. ACM Trans Appl Percept 5(1):2CrossRefGoogle Scholar
  18. 18.
    Zhou H, Yuan X, Cui W, Qu H, Chen B (2008) Energy-based hierarchical edge clustering of graphs. In: 2008 IEEE pacific visualization symposium. IEEE, pp 55–61Google Scholar
  19. 19.
    Zielasko D, Weyers B, Hentschel B, Kuhlen TW (2016) Interactive 3d force-directed edge bundling. In: Computer graphics forum, vol 35. Wiley Online Library, pp 51–60Google Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2019

Authors and Affiliations

  1. 1.School of Computer and InformationHefei University of TechnologyHefeiChina
  2. 2.Department of Computer Science and EngineeringUniversity of North TexasDentonUSA

Personalised recommendations