'Range trees 2d queries' presentation slideshows

Computational Geometry Chapter 12

Computational Geometry Chapter 12. Range queries. How do you efficiently find points that are inside of a rectangle? Orthogonal range query ([ x 1 , x 2 ], [ y 1 ,y 2 ]): find all points ( x, y ) such that x 1 <x<x 2 and y 1 <y<y 2 Useful also as a multi-attribute database query. y. y 2.

635 views • 52 slides