Skip to main content
I want to pick up junctions with a certain weight along my network and determine how many more nodes and line features that are on each branch coming out of each selected junction.
Some additional info on my question.

 

 


Creating network for the relations streams/junctions is basic.

 

But afaiuu want  a recursive procedure?
Yes, it is intended to be a recusive procedure. I'm prepping the points and branches for labelling and symbolizing later for automated map making. I want to reduce the collisions on each junction and or its branch by either moving, scaling, or extending segments and/or points or even branches.I'm facing a wall with the downstream as I have tried multiple options (Linear referencing and netowrk topology) and it always leads me to a preliminary step of creating a segmentation sequence either using distance from the source or using spatial sequence as the "eye" sees the whole data. The iteration will apply rules until it has reached maximum allowable collisions and then lock the junction node or branch and points inside the zone to move to the next downstream junction and its branch until all branches and their endpoints have been reached. So by testing on each junction a lock may be imposed on a compleeted junction and its adjacent branches so there a will be base for the collision zones to refer to.

Problem solved by @takashi in this blogpost Solution


Reply