Extending TreeJuxtaposer Nicholas Chen (nchen@cs.umd.edu)nchen@cs.umd.edu Maryam Farboodi...

Extending TreeJuxtaposer

Nicholas Chen (nchen@cs.umd.edu)

Maryam Farboodi (farboodi@cs.umd.edu)

May 9, 2006

Rendering Infrastructure

Hierarchy of SplitLines segments each dimension of the screen

Screen elements are bounded by pairs of SplitLines in each dimension

Relatively positioned so updates propagate

Before and After

Note how all nodes at a certain height are at the same horizontal position

Before and After

SplitLines are created on the horizontal axis for each distance from the root

Pan and Zoom Interaction

Stretching and squishing will distort the edge lengths

Instead we implement panning and zooming Simulated!

Pan and Zoom Interaction

Stretching and squishing will distort the edge lengths

Instead we implement panning and zooming Simulated!

Structural Differences

and : Phylogenetic trees and : Nodes Similarity score of and Best Corresponding Node (BCN) of Simplified Spanning Tree (SST) of in

Influential factors: Topology (node placements) Edge lengths

11 Tv 22 Tv

2v1v

1v

2T1T

1v 2T

Algorithm

Objectives: Real time computation:

Pre-processing time: Query time:

Low space complexity:

Algorithm: Identifying BCN for each node Computing necessary similarity scores for each

node

)(nO

)log( nnO)(log2 nO

Main Contribution

Edge-length-based similarity score Force BCN of to be on SST of in Identifying BCN of

For each node on SST of in Treat the intersecting node as a group Use the total weight of the subtree beneath

Do not interact with leaves individually

1v1v 2T1v

1v 2T2v

2v