Skip to main content
  • EN

Hi all,

 

I'm looking for the optimal way to create a 'mesh' of potential flow paths to use with the ShortestPathFinder. Currently I feed my workspace a polygon of interest, then to a point cloud of required spacing. Turn that into individual points and then connect them up in the 8 points of the compass using a NeighbourFinder/ListExploder/VertexCreator.

 

My query with this is at the end I have to use the Matcher to remove lots of geometric duplicates where point A has connected to point B, and point B has connected to point A. Line direction is irrelevant to this task so I was wondering if anyone has any ideas as to how I could optimise this process?

You only need the neighbors in the directions 0, 45, 90 and 135, this will get you all connecting lines once. Insert a ListElementFilter (from FME Hub) between the NeighborFinder and the ListExploder.

ListElementFilterDisclaimer: this is a solution with only a minor change to your current workflow, there may be better ways.

You only need the neighbors in the directions 0, 45, 90 and 135, this will get you all connecting lines once. Insert a ListElementFilter (from FME Hub) between the NeighborFinder and the ListExploder.

ListElementFilterDisclaimer: this is a solution with only a minor change to your current workflow, there may be better ways.

Perfect solution to my existing workflow - thanks!

Reply


Community Stats

30,126
Posts
114,348
Replies
37,758
Members
Terms & ConditionsCookie settings
A product of
Safe Software respectfully acknowledges that we live, learn and work on the traditional and unceded territories of the Kwantlen, Katzie, and Semiahmoo First Nations.