Spatial Data Indexing and Point Location
This chapter is concerned with spatial databases. Anyone designing algorithms for geometry processing will invariably need to store data in spatial databases. The chapter begins with an introduction to spatial databases and moves on to discuss particular data structures.
The kD tree for instance is a simple and very popular data structure for storing points in space. Essentially, a kD tree is a binary tree that recursively divides space into smaller regions. The same is true of a binary space partitioning tree, but the planes that divide space can be arbitrarily oriented, and a BSP tree is often used for triangles. Quadtrees and octrees divide space into four and eight sub-regions at each node and thus have a higher branching factor.
The chapter closes with a discussion of object-driven spatial access methods. The distinguishing characteristic of these is that objects are grouped as opposed to space being divided.
KeywordsSpatial Data Voronoi Diagram Random Access Memory Spatial Database Minimum Bound Rectangle
- 2.Shekhar, S., Chawla, S.: Spatial Databases: A Tour. Prentice Hall, New York (2002). http://www.amazon.ca/exec/obidos/redirect?tag=citeulike09-20&path=ASIN/0130174807 Google Scholar
- 5.Wikipedia: kD-tree. http://en.wikipedia.org/wiki/Kd-tree
- 8.Meagher, D.: Octree encoding: a new technique for the representation, manipulation and display of arbitrary three dimensional objects by computer. Technical report IPL,TR-80-111, Rensselaer Polytechnic Institute, Troy, NY, USA (1980) Google Scholar
- 9.Wikipedia: Octree. http://en.wikipedia.org/wiki/Octree
- 11.Wikipedia: Rtree. http://en.wikipedia.org/wiki/R-tree
- 12.Sellis, T.K., Roussopoulos, N., Faloutsos, C.: The R+-tree: a dynamic index for multi-dimensional objects. In: VLDB ’87: Proceedings of the 13th International Conference on Very Large Data Bases, pp. 507–518. Morgan Kaufmann, San Francisco (1987) Google Scholar
- 13.Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The R*-tree: an efficient and robust access method for points and rectangles. In: SIGMOD ’90: Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data, pp. 322–331. ACM, New York (1990). doi: 10.1145/93597.98741 CrossRefGoogle Scholar
- 14.Arge, L., de Berg, M., Haverkort, H.J., Yi, K.: The priority r-tree: a practically efficient and worst-case optimal r-tree. In: SIGMOD ’04: Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data, pp. 347–358. ACM, New York (2004). doi: 10.1145/1007568.1007608 CrossRefGoogle Scholar
- 15.Mount, D.M., Arya, S.: ANN: a library for approximate nearest neighbor searching. http://www.cs.umd.edu/~mount/ANN/ (2010)