Closest Pair of points problem in the planar case.
28 people like thisPosted: 13 years ago by Martin Szarski
Compute the great circle distance of 2 points
3 people like thisPosted: 10 years ago by Samuel Bosch
Simple version of the azimuthal equidistant projection (see also http://fssnip.net/lA) but with measures. This avoids mixing of degrees and radians and longitudes/x and latitudes/y
2 people like thisPosted: 10 years ago by Samuel Bosch
Density-based spatial clustering of applications with noise (DBSCAN) is a data clustering algorithm. For more information see http://en.wikipedia.org/wiki/DBSCAN. The implementation is based on the pseudocode in the article and the following C# code http://www.c-sharpcorner.com/uploadfile/b942f9/implementing-the-dbscan-algorithm-using-C-Sharp/ The implementation is not very functional but does the job. Added pwd by ignorance, the password is "fssnip" (without quotes)
1 people like thisPosted: 10 years ago by Samuel Bosch
Simple and a more optimized implementation of the azimuthal equidistant projection. Input is expected in degrees.
3 people like thisPosted: 10 years ago by Samuel Bosch
Read-only STRtree backed by NetTopologySuite.Spatial.Index.STRTree
2 people like thisPosted: 3 years ago by Swoorup Joshi