Simple, non-efficient, map matcher in go
This is a dev lib. Do not use in production. I wanted to show how to use OSM data, build a rtree to do closest point search and road graph using go. It uses Djikstra to find the fastest path.
The slowness comes, in part, from the huge road graph with all the OSM nodes. It is not efficient. It should be way segments only. This work is in progress.
go get ./...- Download
delaware-latest.osm.pbffile from Geofabrik go run main.go
curl 'http://localhost:8080/match/39.154015,-75.524993;39.154335,-75.526388;39.155399,-75.527152'