Skip to main content
Question

From To list short path finder


ohashkii
Contributor
Forum|alt.badge.img+8

As the short path finder requires FROM.TO. input with line terwork.
I have a data that has 680(From) and 1882(TO). So the From To table will be 1,279,760 record which takes too much time. For analysis.
.
My data extent is 1500m*4000m.
The farthest From To path  in my data never exceed 300m.
My idea is to create a table using neiblghbour finder to search for all( From) point to TO points with a tolerance 300. OR within a boundary.

Or something like excluding  the To found  with minimum distance shirt path finder found.

Is this valid?
I'm trying to minimize the matrix created by FME to reduce  the process for short path finder.
Any help or ideas.?

geomancer
Evangelist
Forum|alt.badge.img+46
  • Evangelist
  • February 11, 2025

My approach would be to use a NeighborFinder with a maximum distance of 300 meters, adding the coordinates and attributes of the TO points to a list, explode the list into features, and turn the FROM points into lines (the coordinates of the TO points are used here). This gives you all FROM-TO-lines.

An alternative would be to buffer the TO points with 300 meters, and use a PointOnAreaOverlayer to determine the FROM points to combine with each TO point.

The results are exactly the same, the workflow with the PointOnAreaOverlayer seems to be just a tiny bit faster.

 


ohashkii
Contributor
Forum|alt.badge.img+8
  • Contributor
  • February 11, 2025

 ​@geomancer total respect .


Reply


Cookie policy

We use cookies to enhance and personalize your experience. If you accept you agree to our full cookie policy. Learn more about our cookies.

 
Cookie settings