Skip to main content

Towards Partially Automatic Search of Edge Bundling Parameters

  • Conference paper
  • First Online:
  • 1814 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10783))

Abstract

Edge bundling methods are used in flow maps and graphs to reduce the visual clutter, which is generated when representing complex and heterogeneous data. Nowadays, there are many edge bundling algorithms that have been successfully applied to a wide range of problems in graph representation. However, the majority of these methods are still difficult to use and apply on real world problems by the experts from other areas. This is due to the complexity of the algorithms and concepts behind them, as well as a strong dependence on their parametrization. In addition, the majority of edge bundling methods need to be fine-tuned when applied on different datasets. This paper presents a new approach that helps finding near-optimal parameters for solving such issues in edge bundling algorithms, regardless of the configuration of the input graph. Our method is based on evolutionary computation, allowing the users to find edge bundling solutions for their needs. In order to understand the effectiveness of the evolutionary algorithm in such kind of tasks, we performed experiments with automatic fitness functions, as well as with partially user-guided evolution. We tested our approach in the optimization of the parameters of two different edge bundling algorithms. Results are compared using objective criteria and a critical discussion of the obtained graphical solutions.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    www.census.gov.

References

  1. Dent, B.: Dynamic representation: the design of flow maps. In: Cartography: Thematic Map Design, vol. 1. WCB/McGraw-Hill (1999)

    Google Scholar 

  2. Phan, D., Xiao, L., Yeh, R.B., Hanrahan, P., Winograd, T.: Flow map layout. In: IEEE Symposium on Information Visualization (InfoVis 2005), 23–25 October 2005, Minneapolis, MN, USA, p. 29 (2005)

    Google Scholar 

  3. Holten, D.: Hierarchical edge bundles: visualization of adjacency relations in hierarchical data. IEEE Trans. Vis. Comput. Graph. 12(5), 741–748 (2006)

    Article  Google Scholar 

  4. Holten, D., van Wijk, J.J.: Force-directed edge bundling for graph visualization. Comput. Graph. Forum 28(3), 983–990 (2009)

    Article  Google Scholar 

  5. Hurter, C., Ersoy, O., Telea, A.: Graph bundling by kernel density estimation. Comput. Graph. Forum 31(3), 865–874 (2012)

    Article  Google Scholar 

  6. Peysakhovich, V., Hurter, C., Telea, A.: Attribute-driven edge bundling for general graphs with applications in trail analysis. In: 2015 IEEE Pacific Visualization Symposium, PacificVis 2015, Hangzhou, China, 14–17 April 2015, pp. 39–46 (2015)

    Google Scholar 

  7. Polisciuc, E., Cruz, P., Amaro, H., Maçãs, C., Machado, P.: Flow map of products transported among warehouses and supermarkets. In: Proceedings of the 11th Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications (VISIGRAPP 2016). IVAPP, Rome, Italy, 27–29 February 2016, vol. 2, pp. 179–188 (2016)

    Google Scholar 

  8. Romero, J., Machado, P., Carballal, A., Correia, J.: Computing aesthetics with image judgement systems. In: McCormack, J., d’Inverno, M. (eds.) Computers and Creativity, pp. 295–322. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-31727-9_11

    Chapter  Google Scholar 

  9. Takagi, H.: Interactive evolutionary computation: fusion of the capabilities of EC optimization and human evaluation. Proc. IEEE 89(9), 1275–1296 (2001)

    Article  Google Scholar 

  10. Machado, P., Romero, J., Cardoso, A., Santos, A.: Partially interactive evolutionary artists. New Gener. Comput. 23(2), 143–155 (2005)

    Article  Google Scholar 

  11. Machado, P., Cardoso, A.: NEvAr – the assessment of an evolutionary art tool. In: Wiggins, G. (ed.) AISB’00 Symposium on Creative and Cultural Aspects and Applications of AI and Cognitive Science, Birmingham, UK (2000)

    Google Scholar 

  12. Ralley, D.: Genetic algorithms as a tool for melodic development. In: International Computer Music Conference, pp. 501–502 (1995)

    Google Scholar 

  13. Rooke, S.: The evolutionary art of steven rooke (1996)

    Google Scholar 

  14. Sims, K.: Artificial evolution for computer graphics, vol. 25. ACM (1991)

    Google Scholar 

  15. Battista, G.D., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, Upper Saddle River (1999)

    MATH  Google Scholar 

  16. Kuntz, P., Pinaud, B., Lehn, R.: Minimizing crossings in hierarchical digraphs with a hybridized genetic algorithm. J. Heuristics 12(1–2), 23–36 (2006)

    Article  MATH  Google Scholar 

  17. Branke, J., Bucher, F., Schmeck, H.: Using genetic algorithms for drawing undirected graphs. In: The Third Nordic Workshop on Genetic Algorithms and their Applications. Citeseer (1996)

    Google Scholar 

  18. Eloranta, T., Mäkinen, E.: Timga: a genetic algorithm for drawing undirected graphs. Divulgaciones Matemáticas 9(2), 155–171 (2001)

    MathSciNet  MATH  Google Scholar 

  19. Wu, H.-Y., Takahashi, S., Lin, C.-C., Yen, H.-C.: A zone-based approach for placing annotation labels on metro maps. In: Dickmann, L., Volkmann, G., Malaka, R., Boll, S., Krüger, A., Olivier, P. (eds.) SG 2011. LNCS, vol. 6815, pp. 91–102. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-22571-0_8

    Chapter  Google Scholar 

  20. Tanahashi, Y., Ma, K.: Design considerations for optimizing storyline visualizations. IEEE Trans. Vis. Comput. Graph. 18(12), 2679–2688 (2012)

    Article  Google Scholar 

  21. House, D.H., Bair, A., Ware, C.: An approach to the perceptual optimization of complex visualizations. IEEE Trans. Vis. Comput. Graph. 12(4), 509–521 (2006)

    Article  Google Scholar 

  22. Gansner, E.R., Koren, Y.: Improved circular layouts. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 386–398. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-70904-6_37

    Chapter  Google Scholar 

  23. Pressley, A.: Elementary Differential Geometry. Springer, London (2010). https://doi.org/10.1007/978-1-84882-891-9

    Book  MATH  Google Scholar 

Download references

Acknowledgments

This project has been supported by Fundação para a Ciência e Tecnologia (FCT), Portugal, under the grants SFRH/BD/109745/2015 and SFRH/BD/114865/2016.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Evgheni Polisciuc .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Polisciuc, E., Assunção, F., Machado, P. (2018). Towards Partially Automatic Search of Edge Bundling Parameters. In: Liapis, A., Romero Cardalda, J., Ekárt, A. (eds) Computational Intelligence in Music, Sound, Art and Design. EvoMUSART 2018. Lecture Notes in Computer Science(), vol 10783. Springer, Cham. https://doi.org/10.1007/978-3-319-77583-8_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-77583-8_15

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-77582-1

  • Online ISBN: 978-3-319-77583-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics