Table of Contents
CSE 326: Data Structures Lecture #19 Katie Quadtree, Multidimensional Superstar
Today’s Outline
Multi-D Search ADT
Applications of Multi-D Search
Range Query
Range Query Examples: Two Dimensions
Range Querying in 1-D
Range Querying in 1-D with a BST
1-D Range Querying in 2-D
2-D Range Querying in 2-D
k-D Trees
Building a 2-D Tree (1/4)
Building a 2-D Tree (2/4)
Building a 2-D Tree (3/4)
Building a 2-D Tree (4/4)
k-D Tree
2-D Range Querying in 2-D Trees
Other Shapes for Range Querying
Find in a k-D Tree
k-D Trees Can Suck (but not when built in batch!)
Find Example
Quad Trees
Building a Quad Tree (1/5)
Building a Quad Tree (2/5)
Building a Quad Tree (3/5)
Building a Quad Tree (4/5)
Building a Quad Tree (5/5)
Quad Tree Example
2-D Range Querying in Quad Trees
Find in a Quad Tree
Quad Trees Can Suck
Find Example
Insert Example
Delete Example
Nearest Neighbor Search
Quad Trees vs. k-D Trees
To Do
Coming Up
|
Author: Steve Wolfman
Email: owner-cse326@cs.washington.edu
Home Page: http://www.cs.washington.edu/326/
Download presentation source
|