SpatialRange construction and intersection are faster than N^2 loops using cmpSpatial but are slower than simple binary search operating on arrays of index values. We need to check construction and intersection for optimization settings and inadvertent N^2 loop behaviors.
SpatialRange construction and intersection are faster than N^2 loops using cmpSpatial but are slower than simple binary search operating on arrays of index values. We need to check construction and intersection for optimization settings and inadvertent N^2 loop behaviors.