Package: RapidPolygonLookup
Type: Package
Title: POLYGON LOOKUP USING KD TREES
Version: 0.1.1
Date: 2019-01-13
Depends: R(>= 2.10.0), sp, RANN, PBSmapping, RgoogleMaps
Author: Markus Loecher <markus.loecher@gmail.com> and Madhav Kumar <madhavkumar2005@gmail.com>
Maintainer: Markus Loecher <markus.loecher@gmail.com>
Description: 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.
License: GPL
LazyLoad: yes
NeedsCompilation: no
Repository: CRAN
Packaged: 2019-01-13 09:21:30 UTC; loecherm
Date/Publication: 2019-01-14 10:30:11 UTC
Built: R 4.1.0; ; 2021-05-26 17:03:21 UTC; unix
