Geo-Indexing - Richard Parker

Indexing and accessing points on the Earth's Surface

We want to reject lots of distant points early and fast. • We therefore sort the points by their GeoString, then use a binary search tree to find them. I call the nodes of the tree “pots”. • Whatever sensible curve we use, we find that the points on the GeoString line tend to be (more-or-less) close together on the Earth. • We then need to be able to take a pot and conclude (if it is true!) that no point is near