lec12

# Lec12 - Outline • Motivation indexing multi-dimensional data • Quadtrees – Definition and Properties – Operations Construction Search •

This preview shows pages 1–5. Sign up to view the full content.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Outline • Motivation: indexing multi-dimensional data • Quadtrees – Definition and Properties – Operations * Construction * Search • Kd-Trees – Definition and Properties – Operations * Construction * Search Lecture 11, Multi-Dimensional Data Structures p. 1 Quadtrees: definitions and properties • A rooted tree • Each internal node has four children • Each node in the quadtree corresponds to a square • Each child node represents one of the four quadrants of the parent node • Recursion stops, when the point set con- tains less than 2 points. Lecture 11, Multi-Dimensional Data Structures p. 2 A Quadtree Subdivision, a 2D example d a b c e f g h i j k l m n o A Quadtree j NE NW SW SE NE NW SE SW NE NW SW SE NE NW SW SE NE NW SW SE NE NWSW SE NE NW SW SE o i m b a SE SW NW NE f g e d c n h l k Lecture 11, Multi-Dimensional Data Structures p. 3 Operations • Construction: running time is related to the smallest distance between points – Divide the square into four quadrants, and par-...
View Full Document

## This note was uploaded on 07/17/2010 for the course CS 240 taught by Professor Ortiz during the Spring '09 term at Waterloo.

### Page1 / 8

Lec12 - Outline • Motivation indexing multi-dimensional data • Quadtrees – Definition and Properties – Operations Construction Search •

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online