geosearch.ppt - Computer Science Department at Princeton University.ppt.pptVIP

Geometric Algorithms Geometric search: Overview Types of data. Points, lines, planes, polygons, circles, ... This lecture. Sets of N objects. Geometric problems extend to higher dimensions. Good algorithms also extend to higher dimensions. Curse of dimensionality. Basic problems. Range searching. Nearest neighbor. Finding intersections of geometric objects. 1D Range Search Extension to symbol-table ADT with comparable keys. Insert key-value pair. Search for key k. How many records have keys between k1 and k2? Iterate over all records with keys between k1 and k2. Application: database q