RapidPolygonLookup (0.1.1)

0 users

POLYGON LOOKUP USING KD TREES.

http://cran.r-project.org/web/packages/RapidPolygonLookup

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.

Maintainer: "Markus Loecher, Sense Networks"
Author(s): Markus Loecher <markus.loecher@gmail.com> and Madhav Kumar <madhavkumar2005@gmail.com>

License: GPL

Uses: PBSmapping, RANN, RgoogleMaps, sp

Released 8 months ago.


1 previous version

Ratings

Overall:

  (0 votes)

Documentation:

  (0 votes)

Log in to vote.

Reviews

No one has written a review of RapidPolygonLookup yet. Want to be the first? Write one now.


Related packages:(20 best matches, based on common tags.)


Search for RapidPolygonLookup on google, google scholar, r-help, r-devel.

Visit RapidPolygonLookup on R Graphical Manual.