Facilitates efficient polygon search using kd trees. Coordinate level spatial data can be aggregated to higher geographical identities like census blocks, ZIP codes or police district boundaries. This process requires mapping each point in the given data set to a particular identity of the desired geographical hierarchy. Unless efficient data structures are used, this can be a daunting task. The operation point.in.polygon() from the package sp is computationally expensive. Here, we exploit kd-trees as efficient nearest neighbor search algorithm to dramatically reduce the effective number of polygons being searched.
|Author||Markus Loecher <email@example.com> and Madhav Kumar <firstname.lastname@example.org>|
|Date of publication||2014-01-28 16:28:53|
|Maintainer||Markus Loecher <email@example.com>|
AddRanges: Add xlim and ylim for each polygon
california.tract10: Census Tract spatial polygons for the state of California
CropSpatialPolygonsDataFrame: Crop polygons to bounding box and adds polygon centers
DiagnoseFailure: Visualize points that could not be mapped using...
FindPolygonInRanges: Use range-search to map points to polygon.
RapidPolygonLookup: Efficient spatial polygon search using kd-trees.
RapidPolygonLookup-package: Polygon lookup using kd trees
SearchForPolygon: Use kd-trees to search the nearest neighbour polygons for a...
sf.crime.2012: Sample data with lat/long information
sf.polys: Spatial polygons of San Francisco