: Patrick (of local lucene fame) thinks it is possible to do extent queries with : the cartesian grid method -- essentially you select the "best fit" level and : cell, and that should be set for anything within the extent. The advantage of : this approach is that it is super-fast and scaleable. The disadvantage is : that it is only as accurate as the grid.
i'm way out of my league on spatial search -- but couldn't you use the grid method to whittle down the result space, and then do the computation to determine if a true overlap exists? -Hoss
