1 / 21

Networks

Networks. cs5984: Information Visualization Chris North. Fun from InfoVis 2001. Visualizing trees as trees vanWijk. Multi-D 1D 2D Hierarchies/Trees Networks/Graphs Document collections 3D. Design Principles Empirical Evaluation Java Development Visual Overviews

KeelyKia
Télécharger la présentation

Networks

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. Networks cs5984: Information Visualization Chris North

  2. Fun from InfoVis 2001 • Visualizing trees as trees vanWijk

  3. Multi-D 1D 2D Hierarchies/Trees Networks/Graphs Document collections 3D Design Principles Empirical Evaluation Java Development Visual Overviews Multiple Views Peripheral Views Where are we?

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

  5. 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

  6. Yuk

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

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

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

  10. Not Trivial

  11. Graph Layout • Aesthetic constraints: • Minimize link crossings • Minimize link lengths • Minimize link bends • Clustering • Force directed layout, springs, gravity • http://java.sun.com/applets/jdk/1.2/demo/applets/GraphLayout/example1.html • Position by attribute values • Hierarchization

  12. Circular Layout

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

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

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

  16. Hyperbolic Layout • Munzner, “H3” • Dhananjay, Samil

  17. Attribute Value Layout • Eick, “SeeNet” • Kuljit, Anil

  18. Scale up

  19. Assignment • Thurs: Networks • Korn, “Multi-Digraphs” • ying, kuljeet • Storey, “SHriMP” • qiang, quoc • Thurs: Homework #3 due • Today: Project status report due

  20. Next Week • Tues: Document Collections • Xia Lin, “Document Space” • samal, ying • Hearst, “Tilebars” • reenal, xueqi • Thurs: Document Collections • Bederson, “Image Browsing” • xueqi, anusha • Card, “Web Book and Web Forager” • mrinmayi, ming

More Related