ABSTRACT
We saw in Chapter 5, that one of the key issues in the design of data structures and algorithms for spatial data is that they should be efficient. This means that even if the datasets are large queries can be answered in a reasonable time. This often leads to quite different solutions for vector and raster data because of their inherently different characteristics. However, one area where similar ideas can be applied to both vector and raster is in indexing objects by their spatial location, which is the subject of this chapter.
