Trees 3

9
Trees 3 cs5984: Information Visualization Chris North

TAGS:

description

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:

Transcript of Trees 3

Page 1: Trees 3

Trees 3

cs5984: Information VisualizationChris North

Page 2: Trees 3

Nifty App of the Day• SAS JMP

Page 3: Trees 3

Review• Connection (node & link)

• Hyperbolic, Conetree, …

• Containment (node in node)• Treemap, Sunburst, …

• Scale: <=1000

A

CB

A

B C

Page 4: Trees 3

Today• Beaudoin, “Cheops”, web

» Satya, Sumithra

Page 5: Trees 3

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)x

f

Page 6: Trees 3

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

Page 7: Trees 3
Page 8: Trees 3
Page 9: Trees 3

Assignment• Read for Thurs

• Wills, “NicheWorks”, web» Denzil, Aarthi

• Read for Tues• Korn, “Multi-Digraphs”, web

» Shumei, Yuying

• Homework #3: Tues Mar 20


1. General Trees 2. Binary Search Trees 3. AVL Trees 4. Heap Trees.

1. General Trees 2. Binary Search Trees 3. AVL Trees 4. Heap Trees.

CSCI 104 B-Trees (2-3, 2-3-4) and Red/Black Trees

CSCI 104 B-Trees (2-3, 2-3-4) and Red/Black Trees

Chapter 5 Trees. 2 5.1 PROPERTIES OF TREES 3 4.

Chapter 5 Trees. 2 5.1 PROPERTIES OF TREES 3 4.

3. Paths, trees, and connectivity

3. Paths, trees, and connectivity

CSC 411 Lecture 3: Decision Trees

CSC 411 Lecture 3: Decision Trees

Jack 3 trees shirt.ai

Jack 3 trees shirt.ai

Chapter 3 Graphs, Trees, and Tours

Chapter 3 Graphs, Trees, and Tours

Overview Chapter 10 2-3-4 Trees and External Storagegrail.cba.csuohio.edu/~lin/cis506/Chapt10.pdfChapter 10 2-3-4 Trees and External Storage • Introduction to 2-3-4 Trees • The

Overview Chapter 10 2-3-4 Trees and External Storagegrail.cba.csuohio.edu/~lin/cis506/Chapt10.pdfChapter 10 2-3-4 Trees and External Storage • Introduction to 2-3-4 Trees • The

1 Unbalanced binary search trees Balanced search trees 2-3-4 trees Red-black trees CSE 30331 Lecture 17 – Balanced trees.

1 Unbalanced binary search trees Balanced search trees 2-3-4 trees Red-black trees CSE 30331 Lecture 17 – Balanced trees.

Example: Base Functions & Pattern Trees inv 1 nand3 3 oai21 3 nor2 2nand2 2 Base Functions: Pattern Trees:

Example: Base Functions & Pattern Trees inv 1 nand3 3 oai21 3 nor2 2nand2 2 Base Functions: Pattern Trees:

EECS 4101/5101 Prof. Andy Mirzaian. Lists Move-to-Front Search Trees Binary Search Trees Multi-Way Search Trees B-trees Splay Trees 2-3-4 Trees Red-Black.

EECS 4101/5101 Prof. Andy Mirzaian. Lists Move-to-Front Search Trees Binary Search Trees Multi-Way Search Trees B-trees Splay Trees 2-3-4 Trees Red-Black.

1 Lecture 12 AVL Trees. 2 trees static dynamic game treessearch trees priority queues and heaps graphs binary search trees AVL trees 2-3 treestries Huffman.

1 Lecture 12 AVL Trees. 2 trees static dynamic game treessearch trees priority queues and heaps graphs binary search trees AVL trees 2-3 treestries Huffman.

Week 3: Minimum Spanning Trees

Week 3: Minimum Spanning Trees

Red-Black Trees - homepages.math.uic.eduhomepages.math.uic.edu/~jan/mcs360/red_black_trees.pdfRed-Black Trees 1 Red-Black Trees balancing binary search trees relation with 2-3-4 trees

Red-Black Trees - homepages.math.uic.eduhomepages.math.uic.edu/~jan/mcs360/red_black_trees.pdfRed-Black Trees 1 Red-Black Trees balancing binary search trees relation with 2-3-4 trees

Balanced Trees - Princeton University Computer · PDF fileBalanced Trees References: Handout on red-black trees 2-3 trees!red-black trees!B-trees 2 Symbol table review Challenge. Guarantee

Balanced Trees - Princeton University Computer · PDF fileBalanced Trees References: Handout on red-black trees 2-3 trees!red-black trees!B-trees 2 Symbol table review Challenge. Guarantee

Trees & Topologies Chapter 3, Part 1

Trees & Topologies Chapter 3, Part 1

Лекция 3: Красно-чёрные деревья (Red-black trees). Скошенные деревья (Splay trees)

Лекция 3: Красно-чёрные деревья (Red-black trees). Скошенные деревья (Splay trees)

Machine Learning Lecture 3 Decision Trees

Machine Learning Lecture 3 Decision Trees

Unit 3 Trees Notes

Unit 3 Trees Notes

CSE 4101/5101 Prof. Andy Mirzaian. Lists Move-to-Front Search Trees Binary Search Trees Multi-Way Search Trees B-trees Splay Trees 2-3-4 Trees Red-Black.

CSE 4101/5101 Prof. Andy Mirzaian. Lists Move-to-Front Search Trees Binary Search Trees Multi-Way Search Trees B-trees Splay Trees 2-3-4 Trees Red-Black.