Grows simultaneously at the same time


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.

It is troubling when each process is trying to acquire the same point.
What is the best way to get around points?

You may not have explained well, so please listen to anything


It looks like this can be easily solved by some graph-algorithms.
Maybe a variation of Dijkstra can help (Widest-Path) ?

Can u give us a file to look up?

Some additional informations would be needed too.
Lets say:

  • can u tell when the algorithm should stop?
  • can u tell where the algorithm restarts in the 4th step?
  • is there a need to avoid paths taken before?

and so on


Also a bit confused by “Select the largest value from the obtained points and draw a line.”

Shouldn’t 88 go to 70 instead of 64 then?

Hi Yuri for reference it is useful to link your previous question about this:

Cheers, Graham

1 Like

This is a diagram of what I want to realize.
The nuance may differ from the sentence presented at the beginning.

Thank you so much!


again, upload a file!

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…


Thank you!

ok,I will upload the file now! (32.1 KB) (32.1 KB)

Processing on a planar grid using Anemone.

Processing on three dimensions using C #

Both files were taught from the past Forum.

Thank you everyone!

Well, I have good and bad news:

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). (127.1 KB)

In fact the Interval (range option in mode) was a bit stupid. Added info on the search +/- limits as well. Use this and rather recycle the V1A: (129.2 KB)

Here’s a 3D demo (zCount > 1) using one of the 12 available combos (TextDot Off for clarity) :

Thank you for your reply.

The message is gone, but what happened?