Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Investigate alternative way network extraction #33

Open
Robbendebiene opened this issue Apr 17, 2024 · 0 comments
Open

Investigate alternative way network extraction #33

Robbendebiene opened this issue Apr 17, 2024 · 0 comments

Comments

@Robbendebiene
Copy link
Member

Robbendebiene commented Apr 17, 2024

  1. Extract OSM way network (including respective relations) in a certain circumference around a stop (could scale depending on the stop area size)
  2. 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)
  3. Iteratively remove all nodes/ways that do not connect at least 2 other edges like a way or platform/stop
  4. Everything left now is the fundamental path network of the stop (problem may be that it contains unused loops)
  5. 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.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant