Extending TreeJuxtaposer Nicholas Chen Maryam Farboodi May 9, 2006.

Slides:

Advertisements

Similar presentations

Polynomial Time Approximation Schemes for Euclidean TSP Ankush SharmaA H Xiao LiuA E Tarek Ben YoussefA

Advertisements

Lecture 15. Graph Algorithms

Surender Baswana Department of CSE, IIT Kanpur. Surender Baswana Department of CSE, IIT Kanpur.

Topological Reasoning between Complex Regions in Databases with Frequent Updates Arif Khan & Markus Schneider Department of Computer and Information Science.

The A-tree: An Index Structure for High-dimensional Spaces Using Relative Approximation Yasushi Sakurai (NTT Cyber Space Laboratories) Masatoshi Yoshikawa.

INTERVAL TREE & SEGMENTATION TREE

Comments We consider in this topic a large class of related problems that deal with proximity of points in the plane. We will: 1.Define some proximity.

Leader Election Let G = (V,E) define the network topology. Each process i has a variable L(i) that defines the leader.  i,j  V  i,j are non-faulty.

Visibility Graph Team 10 NakWon Lee, Dongwoo Kim.

Searching on Multi-Dimensional Data

VIRTUAL ARTHROSCOPIC KNEE SURGERY TRANING SYSTEM Yang Xiaosong The Chinese University of Hong Kong Tsinghua University.

15-853Page : Algorithms in the Real World Suffix Trees.

Lecture 12 : Special Case of Hidden-Line-Elimination Computational Geometry Prof. Dr. Th. Ottmann 1 Special Cases of the Hidden Line Elimination Problem.

Convergent and Correct Message Passing Algorithms Nicholas Ruozzi and Sekhar Tatikonda Yale University TexPoint fonts used in EMF. Read the TexPoint manual.

CSE 421 Algorithms Richard Anderson Dijkstra’s algorithm.

Contents Description of the big picture Theoretical background on this work The Algorithm Examples.

Distance methods. UPGMA: similar to hierarchical clustering but not additive Neighbor-joining: more sophisticated and additive What is additivity?

Filling Arbitrary Holes in Finite Element Models 17 th International Meshing Roundtable 2008 Schilling, Bidmon, Sommer, and Ertl.

I/O-Algorithms Lars Arge Spring 2009 March 3, 2009.

Robust estimation Problem: we want to determine the displacement (u,v) between pairs of images. We are given 100 points with a correlation score computed.

Phylogenetic Tree Construction and Related Problems Bioinformatics.

Partitioned Rendering Infrastructure with Stable Accordion Navigation James Slack MSc Thesis Presentation April 4, 2005.

Binary Trees Chapter 6.

UCSC 1 Aman ShaikhICNP 2003 An Efficient Algorithm for OSPF Subnet Aggregation ICNP 2003 Aman Shaikh Dongmei Wang, Guangzhi Li, Jennifer Yates, Charles.

Orthogonal Range Searching I Range Trees. Range Searching S = set of geometric objects Q = query object Report/Count objects in S that intersect Q Query.

Basics Set systems: (X,F) where F is a collection of subsets of X. e.g. (R 2, set of half-planes) µ: a probability measure on X e.g. area/volume is a.

CS 551/651 Advanced Computer Graphics Warping and Morphing Spring 2002.

UNC Chapel Hill M. C. Lin Orthogonal Range Searching Reading: Chapter 5 of the Textbook Driving Applications –Querying a Database Related Application –Crystal.

VAST 2011 Sebastian Bremm, Tatiana von Landesberger, Martin Heß, Tobias Schreck, Philipp Weil, and Kay Hamacher Interactive-Graphics Systems TU Darmstadt,

UNC Chapel Hill M. C. Lin Line Segment Intersection Chapter 2 of the Textbook Driving Applications –Map overlap problems –3D Polyhedral Morphing.

14/13/15 CMPS 3130/6130 Computational Geometry Spring 2015 Windowing Carola Wenk CMPS 3130/6130 Computational Geometry.

De-Nian Young Ming-Syan Chen IEEE Transactions on Mobile Computing Slide content thanks in part to Yu-Hsun Chen, University of Taiwan.

Parsimony-Based Approaches to Inferring Phylogenetic Trees BMI/CS 576 Colin Dewey Fall 2010.

Data Structure & Algorithm II.  Delete-min  Building a heap in O(n) time  Heap Sort.

Mehdi Mohammadi March Western Michigan University Department of Computer Science CS Advanced Data Structure.

PRESENTED BY – GAURANGI TILAK SHASHANK AGARWAL Collision Detection.

Lars Arge Presented by Or Ozery. I/O Model Previously defined: N = # of elements in input M = # of elements that fit into memory B = # of elements per.

Search by partial solutions.  nodes are partial or complete states  graphs are DAGs (may be trees) source (root) is empty state sinks (leaves) are complete.

A Study of Balanced Search Trees: Brainstorming a New Balanced Search Tree Anthony Kim, 2005 Computer Systems Research.

Static Dictionaries Collection of items. Each item is a pair.  (key, element)  Pairs have different keys. Operations are:  initialize/create  get (search)

InterConnection Network Topologies to Minimize graph diameter: Low Diameter Regular graphs and Physical Wire Length Constrained networks Nilesh Choudhury.

Billy Timlen Mentor: Imran Saleemi.  Goal: Have an optimal matching  Given: List of key-points in each image/frame, Matrix of weights between nodes.

Segment Trees Basic data structure in computational geometry. Computational geometry.  Computations with geometric objects.  Points in 1-, 2-, 3-, d-space.

Parsimony-Based Approaches to Inferring Phylogenetic Trees BMI/CS 576 Colin Dewey Fall 2015.

Barnes Hut N-body Simulation Martin Burtscher Fall 2009.

1 An Efficient Optimal Leaf Ordering for Hierarchical Clustering in Microarray Gene Expression Data Analysis Jianting Zhang Le Gruenwald School of Computer.

Probabilistic Approaches to Phylogenies BMI/CS 576 Sushmita Roy Oct 2 nd, 2014.

Distance-Based Approaches to Inferring Phylogenetic Trees BMI/CS 576 Colin Dewey Fall 2010.

Graphs Definition: a graph is an abstract representation of a set of objects where some pairs of the objects are connected by links. The interconnected.

Fitch-Margoliash Algorithm 1.From the distance matrix find the closest pair, e.g., A & B 2.Treat the rest of the sequences as a single composite sequence.

Barnes Hut N-body Simulation Martin Burtscher Fall 2009.

Quartet distance between general trees Chris Christiansen Thomas Mailund Christian N.S. Pedersen Martin Randers.

3.1 Height-Balanced Trees 3.2 Weight-Balanced Trees

KD Tree A binary search tree where every node is a

Segment tree and Interval Tree

Orthogonal Range Searching and Kd-Trees

Greedy Algorithms / Dijkstra’s Algorithm Yin Tat Lee

Junqi Zhang+ Xiangdong Zhou+ Wei Wang+ Baile Shi+ Jian Pei*

Topological Ordering Algorithm: Example

Comparative RNA Structural Analysis

Covering Uncertain Points in a Tree

CMPS 3130/6130 Computational Geometry Spring 2017

Topological Ordering Algorithm: Example

Topological Ordering Algorithm: Example

CMPS 3130/6130 Computational Geometry Spring 2017

CSE 417: Algorithms and Computational Complexity

Topological Ordering Algorithm: Example

Force Directed Placement: GPU Implementation

Presentation transcript:

Extending TreeJuxtaposer Nicholas Chen Maryam Farboodi 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

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

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