uncertainty at edge of service areas
Opened this issue · 0 comments
josephholler commented
The vertices selected by dijstra's shortest path don't necessarily reach the maximum travel time, which will usually be at some point in between intersections.
It should be possible to find all of the boundary edges of a subgraph, and calculate the remaining travel time along those edges. The same could be done for the interior distance bands.
I don't necessarily want to implement this... it's something to consider for 'future work', along with a better (concave?) polygon representation of service areas.