I’d like to make growing simultaneously at the same time programs.
It shows the procedure of the program.
1.Obtain a point on the grid.
2.Acquire point data scattered around from the point selected in 1.
3.Select the largest value from the obtained points and draw a line. 4.The same process is repeated from the selected point. (This is the biggest problem)
5.Repeat this.
The following picture is a process without step 4.
So we have the same data to process on.
I’m not going to rebuild ur grid, nor check all the values to populate it one by one.
U have it allready there so upload it.
U can check at ur own too, if u like…
There a some Graph-Algorithms u can check out… If u upload a file we may go together…
The bad ones are that the attached is pure code … meaning that you can use it only as a toy for fun (unless at some later time you start learning how to code - a thing highly recommended).
The good ones are that the results ARE not as you expect IF your values are properly randomly spread in the 2/3D grid.
PS: There’s a 3D grid/values option (zCount > 1) available for the very brave.
PS: You have 3x2x2 = 12 possible workarounds depending on the option that you pick (for instance: Greater, Smaller, In Range … or the Ortho boolean … etc etc).
