Spatial indexing for accelerated algorithms in Julia

This code is a collection of spatial indexing algorithms for accelerating in-memory spatial searching in Julia. Currently, it supports: linear and R-tree indexing, and point, subset, contains, and intersection queries. Each element in the data structure can be one of many (primarily convex) sets defined in LazySets.jl.

Source code: Github