-
Notifications
You must be signed in to change notification settings - Fork 0
Open
Description
We need to find the best route between two points (ideally, two addresses or geoplaces as in Google Maps or Openstreetmap) with the conditions that
-
route must follow streets (ideally from OSM), i.e. not being a direct line between the two points. Must be possible to make it walking
-
route must minimize cost, in terms of selecting the most shaded routes as coming from the shade raster for that date and time
Metadata
Metadata
Assignees
Labels
No labels