Programming challenges

[edzer]

• building on the sf package, write a function that for p features, given n, finds the n nearest features and returns their index as a list with integer vectors. A brute-force method would first compute the complete distance matrix using st_distance; a smarter method avoids storing the full matrix by iterating over the features, a really smart method uses a spatial index to avoid having to compute all distances. See also Planar index r-spatial/sf#76
• ideas and wishes from several people are mentioned here and in links found there

[edzer]

Create a function that plots an sf object automatically over a google map or OSM background; see e.g.
dkahle/ggmap#162
and argument bgMap in sf:::plot_sf.