Spatial Data Structures, Computations

• Spatial Data Structures (Points, rectangles, circles etc.)

• Indices for spatial data structures are made using

  • Multi-dimensional trees
  • R-Trees/R*-Trees

• Spatial Computation Techniques

  • Spatial Joins: Quite expensive. Uses R*-Trees for efficiency. First step finds all possible pairs of intersecting objects. Second step uses detailed methods to check for intersection.
  • Map overlays are used in GIS.

Previous slide

Next slide

Back to first slide

View graphic version