RapidPolygonLookup-package {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)" <[e-mail]>, Madhav Kumar <[e-mail]>
Maintainer:	"Markus Loecher" <[e-mail]>
License:	GPL
LazyLoad:	yes

Author(s)

Markus Loecher <[e-mail]> and Madhav Kumar <[e-mail]>