Title: Exploring and Evaluating Edge Bundling for Large Graph Visualization
Abstract: Edge bundling is an effective approach to mitigate visual clutter and convey high-level structures for graph visualization. Various edge bundling algorithms have been proposed to generate visually appealing results for different applications. However, it remains challenging to design practical edge bundling algorithms for large graphs and evaluate resulting graph drawings. In this talk, I will introduce a few algorithms we developed to improve the efficiency and effectiveness of edge bundling. I will also illustrate the ambiguity from visualization results and present a new algorithm to evaluate resulting layouts of edge bundling.
Bio: Hongfeng Yu is an associate professor in Computer Science and Engineering at the University of Nebraska-Lincoln. Currently, he is also serving as the interim director of Holland Computing Center. He received his B.S. degree and M.S. degree in Computer Science from Zhejiang University, and Ph.D. degree in Computer Science from the University of California-Davis. After his Ph.D. graduation, he spent four years as a postdoctoral researcher at Sandia National Laboratories, California. His research concentrates on big data analysis and visualization, high-performance computing, and user interfaces and interaction.
After the presentation, there will be a short time for discussion and questions afterwards.
Talks are recorded live via Zoom and are available for viewing later after the talk.