1 / 9

Trees 3

Trees 3. cs5984: Information Visualization Chris North. Nifty App of the Day. SAS JMP. Review. Connection (node & link) Hyperbolic, Conetree, … Containment (node in node) Treemap, Sunburst, … Scale: <=1000. A. B. C. A. B. C. Today. Beaudoin, “Cheops”, web Satya, Sumithra.

curt
Download Presentation

Trees 3

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

  2. Nifty App of the Day • SAS JMP

  3. Review • Connection (node & link) • Hyperbolic, Conetree, … • Containment (node in node) • Treemap, Sunburst, … • Scale: <=1000 A B C A B C

  4. Today • Beaudoin, “Cheops”, web • Satya, Sumithra

  5. The Original Fisheye View • George Furnas, 1981 (pg 311) • Large information space • User controlled focus point • How to render items? • Normal View: just pick items nearby • Fisheye View: pick items based on degree of interest • Degree of Interest = function of distance from f and a priori importance • DOI(x) = -dist(x,f) + imp(x) f x

  6. Example: Tree structure • Distance = # links between f and x • Importance = level of x in tree Distance: I 3 A 2 a 3 i 4 ii 4 b 1 i 2 ii 0 B 4 a 5 i 6 ii 6 b 5 i 6 ii 6 Importance: I 0 A -1 a -2 i -3 ii -3 b -2 i -3 ii -3 B -1 a -2 i -3 ii -3 b -2 i -3 ii -3 DOI: I -3 A -3 a -5 i -7 ii -7 b -3 i -5 ii -3 B -5 a -7 i -9 ii -9 b -7 i -9 ii -9 f

  7. Assignment • Read for Thurs • Wills, “NicheWorks”, web • Denzil, Aarthi • Read for Tues • Korn, “Multi-Digraphs”, web • Shumei, Yuying • Homework #3: Tues Mar 20

More Related