Regular Grid Spatial Decomposition Overlay
Regular Grid Spatial Decomposition Overlay Documentation

This documentation describes code implementing regular grid based line segment intersection algorithms for computing the overlay of regions and shared memory parallelization techniques for the algorithms. The implementation uses OpenMP for parallelization.

This code includes two versions of algorithms. One is hash table based algorithm using hash tables to store the grid information. The second implementation is sorted vector based which uses vectors to store the grid information.

The code computes the overlay of two input regions. The line segments that are returned are labeled such that the intersection, union, or difference can be computed by keeping line segments with the proper labels.

Source code for the project is available at:

https://bitbucket.org/marmcke/code_spatialdecompositionoverlay