RapidPolygonLookup: Polygon lookup using kd trees

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.

Version: 0.1
Depends: R (≥ 2.10.0), sp, RANN, PBSmapping, RgoogleMaps
Published: 2014-01-28
Author: Markus Loecher and Madhav Kumar
Maintainer: Markus Loecher <markus.loecher at gmail.com>
License: GPL-2 | GPL-3 [expanded from: GPL]
NeedsCompilation: no
CRAN checks: RapidPolygonLookup results

Downloads:

Reference manual: RapidPolygonLookup.pdf
Vignettes: RapidPolygonLookup: An R Package for polygon lookup using kd-trees
Package source: RapidPolygonLookup_0.1.tar.gz
Windows binaries: r-devel: RapidPolygonLookup_0.1.zip, r-release: RapidPolygonLookup_0.1.zip, r-oldrel: RapidPolygonLookup_0.1.zip
OS X Snow Leopard binaries: r-release: RapidPolygonLookup_0.1.tgz, r-oldrel: RapidPolygonLookup_0.1.tgz
OS X Mavericks binaries: r-release: RapidPolygonLookup_0.1.tgz