Module 4: Index Structures
Lecture 14: Quadtrees and k-d-trees
Searching in quadtrees
Point search requires angle determination
Range search requires
Minimum bounding rectangle computation
Overlapped rectangles computation
Time can be
in worst case
in worst case
