Improve efficiency of polygon cropping

[jarad]

Currently the polygon cropping algorithm searches through all (future, in time) polygons to find overlap with the current polygon. But really the algorithm only needs to search through neighboring polygons. The algorithm could be more efficient by first finding these neighbors and then finding overlap.

The R package FNN will find nearest neighbors quickly.