{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

JonLeonardSpacePartitioningDataStructures

# JonLeonardSpacePartitioningDataStructures - Space-based...

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

Space-based Partitioning Data Structures and their Algorithms Jon Leonard

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

View Full Document
Purpose Space-based Partitioning Data Structures are an efficient way of organizing data that lies in an n-dimensional space 2D, 3D, even 4D and beyond Reasoning about the data is usually much easier Bottom Line: Cut down on the search space
Example 1 X Values Y Values 1 3 5 6 9 3 3 1 8 8 4 9 1 2 2 4 8 1 4 2 7 2

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

View Full Document
Outline Quadtrees Octrees Binary Space Partitions (BSP) Kd-Trees R-Tree Bounded Volume Hierarchy (BVH)
Outline Quadtrees Octrees Binary Space Partitions (BSP) Kd-Trees R-Tree Bounded Volume Hierarchy (BVH)

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

View Full Document
Quadtree Origins The term Quadtree was coined by Raphael Finkel and J.L. Bentley in 1974 A data structure to store data in two dimensions Follows the same intuition as a binary tree Binary Tree: I have one range of data I want to partition Quadtree: I have two ranges of data I want to partition
Quadtree Quadtrees represent finite, square areas The internal nodes of a quadtree are also finite, square areas that make up a quadrant of their parent node's region As such, each internal node has four children, one for each quadrant The leaf nodes of a quadtree hold a finite number of elements Filled leaf nodes will break into four quadrants and the data is inserted into the quadrants

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

View Full Document