-
@mclaeysb Thank you for the library!
I'm quite interested in the Subramaniam algorithm, but the paper is quite vague on details — e.g. it's not clear what order the edges should be processed if th…
-
I'm doing some work on a LOT of points (buffers and intersects and all that fun stuff) & have noticed things were getting slow. When I dug into it, I noticed the `destination()` uses Haversine, which …
-
We should change the domain adaptation Classes to be more sklearn compliant.
Main issues:
- Use CamelCase for classes
- Use __init__ for setting parameters and instead of fit.
@agramfort prop…
-
We currently use NTS for all of our geospatial calculations. There is a small issue though, because NTS only handles calculations based on a Euclidean plane.
The Earth is a spheroid, and because of t…
-
Silva and Tenenbaum described in the paper [Global versus local methods
in nonlinear dimensionality reduction](http://web.mit.edu/cocosci/Papers/nips02-localglobal-in-press.pdf) an extension of ISOMAP…
-
-
could use catmaid's algorithm (or at least provide this method) although R will have many smoother options. The main issues are how to decide
1. the neighbourhood of any point
2. whether there is any …
-
We have a "drop this item within a certain radius" feature in our app.
For example, we try to illustrate how far away from the center point the user can drop something using an `L.circle` instance, w…
-
I have implemented turf.buffer around a polygon with a distance of 50 metres and the polygon returned varies in size between 30 - 50 metres approx greater than the original.
![buffer](https://cloud.…
-
**Reported by warmerdam on 17 Jun 2008 15:46 UTC**
You can demonstrate the problem with the PROJ.4 commandline program cs2cs:
```
cs2cs +proj=latlong +datum=WGS84 +to +proj=utm +zone=32 +datum=WGS84
…