jeansfere.blogg.se

Fme soccer
Fme soccer












fme soccer
  1. #Fme soccer how to
  2. #Fme soccer download

At worst you'll need to do a small bit of editing, but I don't see much work involved.

fme soccer

Just run it first (the data is included) and see if it's producing what you want.Īt best you might then be able to just feed your building centre points directly into the workspace.

#Fme soccer download

So, download the workspace from that blog article (or a direct link here) and give it a try.

fme soccer

The output I then send into the ShortestPathFinder, using Ordnance Survey roads data as the network. Then I just explode the list and turn it into a line feature: But I don't why it shouldn't work.īasically what I do is merge the features onto each other, so that each object has a list of the other objects. FWFC club members can train year-round on lighted, turf fields, with nationally licensed coaches. Providing soccer opportunities for Federal Way at the recreational, select, and premier levels of play. There are only 20 teams rather than 300+ so you might find it takes a bit longer for you to run. Federal Way Football Clubs community-based soccer program provides the highest level of competition attainable for its members. I wanted to figure out the shortest distance between each of them to see which team's supporters had the longest journey.

#Fme soccer how to

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.














Fme soccer