You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Extract OSM way network (including respective relations) in a certain circumference around a stop (could scale depending on the stop area size)
Remove all nodes that are only part of a single way (so ways with multiple nodes will become more like an edge with a start and end node)
Iteratively remove all nodes/ways that do not connect at least 2 other edges like a way or platform/stop
Everything left now is the fundamental path network of the stop (problem may be that it contains unused loops)
Convert all nodes to AccessSpaces and ways to SitePathLinks
Notes:
To catch the case that a barrier, door etc. is in the middle of a way we need to check every node of a way.
Have a qualifiesAsAccessSpace that checks every node:
bool qualifiesAsAccessSpace (node) {
if (node is junction) true
if (node connects different ways [use wayEqualityHeuristics]) true
if (node is of specific type like barrier) true
}
bool wayEqualityHeuristics (way1, way2) {
// could be as simple as comparing ALL way tags for equality
// it could also only check particular tags to merge more ways together
if (way1.tag.name != way2.tag.name) true
}
Make the algorithm target point (quays, entrances, ...) agnostic.
The text was updated successfully, but these errors were encountered:
AccessSpace
s and ways toSitePathLink
sNotes:
Have a
qualifiesAsAccessSpace
that checks every node:The text was updated successfully, but these errors were encountered: