I found the R-Tree idea fascinating. Conceptually, this is exactly what I need.
But indeed, my case is very simple: my dataset is not sparse, my tiles never
overlap (for a given zoom factor), the number of tiles is still rather small,
they are all rectangular and the same size (modulo edge
Hi,
My application displays very large images at different zoom factors. I have
tiled my images into individual tiles of a much smaller size. Each image has
hundreds of tiles. The tiles will be used to interactively display the image
and the speed of the zooming and panning is very important.
Hi,
I think an R Tree is what you are after.
http://www.sqlite.org/rtree.html
/eno
___
sqlite-users mailing list
sqlite-users@sqlite.org
http://sqlite.org:8080/cgi-bin/mailman/listinfo/sqlite-users
Actually, for what he wants, you don't need anything fancy. A simple
multi-column index is enough.
The R-Tree is to allow queries of a sparse dataset, that might also
have overlaps.
So: A simple index for your background imagery. An R-Tree index for
the features added on top of your background
