Hi! I need to find a Neighbor Line to the line. I am interested in the average distance between these neighbors. Using NeighborFinder i have only the closest vertex of the line. I need tej farthest too.
Solved
NeighborFinder line
Best answer by lau
You can split your line into vertex (LineDivider). Then for each vertex generated, find the closest line (NeighborFinder). You can calculate the average with a StatisticsCalculator
+3You can split your line into vertex (LineDivider). Then for each vertex generated, find the closest line (NeighborFinder). You can calculate the average with a StatisticsCalculator
+48- Celebrity
Here's a quick stab at it.
I break down the base and candidate lines into their indivudual points, then run the NeighborFinder without a max candidates or max distance parameter set. Then find the max distance per base point (by sorting the candidate list), aggregate them and the again sort the candidate list to get the max distance overall.
+48- Celebrity
lau wrote:
You can split your line into vertex (LineDivider). Then for each vertex generated, find the closest line (NeighborFinder). You can calculate the average with a StatisticsCalculator
Thanks a lof for your help @lau and @redgeographics
But i found a little problem. What if i have 2 lines candidates 1:on the left and 2: on the right side of the base-line? i would like to find a neighbor in each of candidates
+3tramm wrote:
Thanks a lof for your help @lau and @redgeographics
But i found a little problem. What if i have 2 lines candidates 1:on the left and 2: on the right side of the base-line? i would like to find a neighbor in each of candidates
Reply
Rich Text Editor, editor1
Editor toolbars
Press ALT 0 for help
Helpful Members This Week
Enter your E-mail address. We'll send you an e-mail with instructions to reset your password.