Skip to main content
Question

Find neighboring points


spiderman
Contributor
Forum|alt.badge.img+7

Hello ,

i would like that each point to find the neighbor point .each point connects with other by a line .

so I have a starting point ,i should find the neighbor point and the neighbor point find the next neighbor and so on .

my problem :

how to let each point to stop looking for the neighbour point if the next point is a starting point because some points are connecting to starting point

FME 2021

6 replies

geomancer
Evangelist
Forum|alt.badge.img+50
  • Evangelist
  • July 3, 2023

Can you describe the end result you are looking for? Or provide a sketch?

Are you looking for a situation where all points are part of one network, in which every point is connected directly to 2 other points (except for 2 end points, that are only connected directly to one other point)?

Or are you looking for a tree structure? Or something else?


spiderman
Contributor
Forum|alt.badge.img+7
  • Author
  • Contributor
  • July 3, 2023
geomancer wrote:

Can you describe the end result you are looking for? Or provide a sketch?

Are you looking for a situation where all points are part of one network, in which every point is connected directly to 2 other points (except for 2 end points, that are only connected directly to one other point)?

Or are you looking for a tree structure? Or something else?

@geomancer​ 

I am looking for all points ,that connects together

as example

in case point connect with 2 point

point a connect with point b

point a connect with point d

in case point connect with one point

point b connect with point e

in case the point connect in 3 direction

point e connect with point f

Point e connect with point g

point e connect with point k

all point above find the next neighbor

I need to extract this information

what is the neighbor point of each base point ?

u could say ,that I am looking for tree structure .

but in case i started from point a

and one point later connects with point a so i do not need it to look for more at this direction Bcs k have found the points from point a before


geomancer
Evangelist
Forum|alt.badge.img+50
  • Evangelist
  • July 4, 2023

If you are looking for something like a Minimum Spanning Tree, it looks like there is no simple solution in FME. This article uses FME and R.

Edit: For ideas for a Steiner Tree see this article using FME and Python.


geomancer wrote:

If you are looking for something like a Minimum Spanning Tree, it looks like there is no simple solution in FME. This article uses FME and R.

Edit: For ideas for a Steiner Tree see this article using FME and Python.

Thank you, you saved my day.


spiderman
Contributor
Forum|alt.badge.img+7
  • Author
  • Contributor
  • July 22, 2023
geomancer wrote:

Can you describe the end result you are looking for? Or provide a sketch?

Are you looking for a situation where all points are part of one network, in which every point is connected directly to 2 other points (except for 2 end points, that are only connected directly to one other point)?

Or are you looking for a tree structure? Or something else?

I am looking for a tree structure ,how could I start ?which ideas should I follow ?


geomancer
Evangelist
Forum|alt.badge.img+50
  • Evangelist
  • July 24, 2023
spiderman wrote:

I am looking for a tree structure ,how could I start ?which ideas should I follow ?

Please see my reply from July 4.


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