RapidPolygonLookup-package: Polygon lookup using kd trees
In RapidPolygonLookup: POLYGON LOOKUP USING KD TREES
Description
This package 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.
Details
Package: RapidPolygonLookup
Type: Package
Title: Polygon lookup using kd trees
Version: 0.1
Date: 2013-11-18
Depends:
R(>= 2.10.0),
sp,
RANN,
PBSmapping,
RgoogleMaps
Author: "Markus Loecher, Berlin School of Economics and Law (BSEL)"
<markus.loecher@gmail.com>,
Madhav Kumar <madhavkumar2005@gmail.com>
Maintainer: "Markus Loecher" <markus.loecher@gmail.com>
License: GPL
LazyLoad: yes
Author(s)
Markus Loecher <markus.loecher@gmail.com> and Madhav Kumar <madhavkumar2005@gmail.com>
RapidPolygonLookup documentation built on May 2, 2019, 7:08 a.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Description
This package 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.
Details
| Package: | RapidPolygonLookup |
| Type: | Package |
| Title: | Polygon lookup using kd trees |
| Version: | 0.1 |
| Date: | 2013-11-18 |
| Depends: | R(>= 2.10.0), sp, RANN, PBSmapping, RgoogleMaps |
| Author: | "Markus Loecher, Berlin School of Economics and Law (BSEL)" <markus.loecher@gmail.com>, Madhav Kumar <madhavkumar2005@gmail.com> |
| Maintainer: | "Markus Loecher" <markus.loecher@gmail.com> |
| License: | GPL |
| LazyLoad: | yes |
Author(s)
Markus Loecher <markus.loecher@gmail.com> and Madhav Kumar <madhavkumar2005@gmail.com>
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.