- DBSCAN (geographic)
- Minimum spanning tree
- DBSCAN centers (sklearn)
- Delaunay triangulation (scipy)
- Remove long triangles (networkx)
- Trace Shortest path trough triangle network (geographic distance)
Shortest path on sphere? Maybe use trick of two distance-preserving projected worlds side-by-side?
- DBSCAN centers (sklearn)
- Delaunay triangulation (scipy)
- Remove long triangles (networkx)
- Trace Shortest path trough triangle network (geographic distance)
Methods: https://futuretravel.today/approximating-public-transport-route-from-cloud-of-gps-locations-55651a2865ab http://geoffboeing.com/2014/08/clustering-to-reduce-spatial-data-set-size/ https://geoffboeing.com/2016/06/mapping-everywhere-ever-been/
Data: https://github.com/miszu/Public-transport-delays-analysis/blob/master/locations.csv http://www.aishub.net/ http://marinetraffic.com (livemap station JSON)
Documentation: https://ipyleaflet.readthedocs.io/en/latest/