I have 4 linear features that are all parallel from eachother, and set at unequal spacing from eachother. I am looking to calculate the nearest distance left and right from each linear feature to the next linear feature. Having trouble figuring out how to make this work. Any help is much appreciated
Page 1 / 1
I would use a LeftRightSpatialCalculator with your features sent to both base and candidate to get a relative position list of which features are to the left vs right (the current feature will be undefined) - you need a Key attribute for this.
Then a neighborfinder (candidates only) with the Close Candidate list (for your specific case you can set the number of neighbours to 3, in a more generic case the number of neighbours should be the maximum number of candidates on a side +1, I would use a list histogrammer on the relative position list to determine that.)
You can then go through the close candidate list to get the Key ID of the closest feature and then check the relative position list to see if it's left or right. Keep going through the close list until you find both a left and right, or reach the end of the list (one feature will have no left, and the other no right)
I think you'll need to bury yourself in Lists for this one. I think the LeftRightSpatialCalculator and the NeighborFinder should get you close to what you're looking for. Something like the attached, though with more effort to extract the intel from the lists.
Cheers, Dave
I would use a LeftRightSpatialCalculator with your features sent to both base and candidate to get a relative position list of which features are to the left vs right (the current feature will be undefined) - you need a Key attribute for this.
Then a neighborfinder (candidates only) with the Close Candidate list (for your specific case you can set the number of neighbours to 3, in a more generic case the number of neighbours should be the maximum number of candidates on a side +1, I would use a list histogrammer on the relative position list to determine that.)
You can then go through the close candidate list to get the Key ID of the closest feature and then check the relative position list to see if it's left or right. Keep going through the close list until you find both a left and right, or reach the end of the list (one feature will have no left, and the other no right)
Ahhh, when posts collide! I must learn to refresh the page before posting. Oh well, at least we both had the same thoughts...
Thanks guys, this is very helpful. I was close. Let me try this out, and see what this gets me. The challenge with this particular workflow is that I am needing to run this on a dataset of about 1000+ linear features.
Thanks guys, this is very helpful. I was close. Let me try this out, and see what this gets me. The challenge with this particular workflow is that I am needing to run this on a dataset of about 1000+ linear features.
When dealing with large numbers of features and lists, prune as much as possible as fast as possible.
get rid of all the candidate angles, label angle, closest xy, fme attributes and especially the _nearest{}._relative_position{}
what you want is just
(key attribute)
_relative_position{}.base_id
_relative_position{}.position
_nearest{}.(key attribute name)
_nearest{}.distance
When looping though or comparing lists, I generally find that python is more efficient
I'd say the NeighborPairFinder is the best solution... provided that your lines are really parallel and at regular spacing/intervals. If the lines intersect or have unequal spacing (eg you have two lines on the left that are both closer than the nearest line on the right) then it's going to be a tougher task - but as the other good folks here have said, the LeftRightSpatialCalculator will help, as would the _angle attributes from the NeighborFinders.
@dcal122890
..post failed?
lines are paralell...so..
Aggregate the lines.
Create oriented bounding box.
Coerce to box to line.
Create mid line (or if needed half-, quarterlines. Depending on distribution of lines)
Intersect box with the paralel lines. (use list)
At least one line will now be intersected by all lines (test for number of nodes = number of paralell lines) and yielding your answer (in a list)
I'd say the NeighborPairFinder is the best solution... provided that your lines are really parallel and at regular spacing/intervals. If the lines intersect or have unequal spacing (eg you have two lines on the left that are both closer than the nearest line on the right) then it's going to be a tougher task - but as the other good folks here have said, the LeftRightSpatialCalculator will help, as would the _angle attributes from the NeighborFinders.
@dcal122890
something like this..
