Die heruntergeladenen Daten sollten an den Open Spaces erweitert werden.
1 foreach open space polygon P do
2 extract all nodes N of P;
3 create edges between all N;
4 foreach edge between all N do
5 set edge from_id and to_id to the respective node IDs;
6 avoid duplication of edges by checking node_from_id < node_to_id;
7 end
8 remove edges which are not within P;
9 insert all remaining edges into the routing graph.;
10 end
Extended algorithm for adding only relevant visibility graph edges to the routing graph
1 foreach open space polygon P do
2 execute lines 2-8 of the base algorithm;
3 identifiy all nodes Nc which connect to the existing routing graph;
4 compute shortest paths between all Nc;
5 remove edges which are not on the shortest paths;
6 insert all remaining edges into the routing graph;
7 end