I wanted to figure out the shortest distance between each of them to see which team's supporters had the longest journey. However, I'm open to other suggestions on how to approach this problem/suggestions on other tools to use.Īlso, it might be worth noting that there are 300+ buildings on the campus, so I'm uncertain whether the methodology that I devised above would not work since there would be so many possible building combinations.įunnily enough I did exactly the same thing, except this was for British football (soccer) teams. After creating this information, my idea is to use the lines between all possible buildings as input into the From-To port in the ShortestPathFinder tool. I'm interested in creating this information so that I can identify the shortest possible route between two buildings based on a pedestrian network layer that runs throughout campus. For example, if the buildings on campus include Buildings A, B, and C, I'm trying to create a line between Buildings A and B, Buildings B and C, and Buildings A and C. The points represent the center of a building on a campus, and I'm trying to create a line between one building and all other buildings on campus. I'm working on creating a map where I'm trying to create a line between one point and all other points using FME.
0 kommentar(er)
