1 / 29

Graph Visualization

This article explores the concepts and techniques of graph visualization, including graph structures, visualization approaches, layout styles, and common layout algorithms. It also discusses challenges and provides examples of graph visualization applications.

goley
Download Presentation

Graph Visualization

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Graph Visualization cs5764: Information Visualization Chris North

  2. Where are we? Multi-D 1D 2D 3D Trees Graphs Document collections Design Principles Empirical Evaluation Visual Overviews

  3. Networks • Graph = nodes + edges • Nodes and edges have attributes • Tabular storage: 1 table for nodes, 1 table for edges • Examples: • Web, roads, telephone, internet, cpu architecture, travel, document citations • Tasks: • shortest path, all paths • neighbors, degree • topology, connected components, sub-graphs • Web domain: broken links, navigation, update, sitemap, orientation

  4. Visualization Approaches • Connections (nodes & links) • Nodes: • Size, color, shape, location, label, … • Links: • Direction, width, color, shape, label, … • Other approaches? • adjacency matrix, containment, … A C A B

  5. Yuk

  6. Challenges • Graph layout • Scale • Navigation • Problem: Bowl of spaghetti!

  7. Graph Layout Styles • Straight line • Arc • Orthogonal

  8. Aesthetic constraints • Minimize link crossings • Minimize link lengths • Minimize link bends • Maximize symmetries • …

  9. Not Trivial

  10. Common Layout Algorithms • Circular • Concentric • Layering • Force directed • Clustering • Hierarchical clustering • Convert to tree • Geographic, pre-determined

  11. Circular Layout

  12. Radial Layout • http://bailando.sims.berkeley.edu/infovis.html

  13. Force directed layout • Springs, gravity, clustering • http://java.sun.com/applets/jdk/1.2/demo/applets/GraphLayout/example1.html

  14. Tree Layout • WebSphinx • http://www-2.cs.cmu.edu/~rcm/websphinx/workbench.html

  15. Hyperbolic Layout • Munzner, “H3”

  16. Attribute Value Layout • Eick, “SeeNet”

  17. Scale up

  18. Multi-Digraphs • Korn, “Multi-Digraphs”

  19. Adjacency Matrix Connex by PNNL

  20. Hierarchical Aggregation • by Feiner • 1. Cluster

  21. Hierarchical Aggregation • 2. Group hierarchically

  22. Hierarchical Aggregation • 3. Link inheritance

  23. SHriMP • Storey, “SHriMP”

  24. ThinkMap – Visual Thesaurus • http://www.visualthesaurus.com • Show only depth 1 from focus node

  25. Harmony Web Browser • by Keith Andrews • Show limited depth from focus node

  26. Harmony Web Landscape • 3D

  27. StarLight • http://www.pnl.gov/infoviz/technologies.html#starlight • PNL

More Related