this is a bit like the wanderer2d patch, but it would require the particles to behave like this:
On create:
align to point on grid
on Update
set Main direction
set direction tendency
check travelled distance - if ( distance > 1 Gridsegment ) change direction by gridangle
My first try looked like this.
Im not really sure if using frac to check the distance is a smart way, but also have no idea how to sample position values in vl to check the travel distance for particles.
also thought about creating a Grid-pointspread, check for closest point and move the particles by linear interpolation, but again no idea if this would be easier.
Any hit to a somewhat similar patch would be great. I know this should be easy in VL compared to vvvv but im always lost where to start.
Yes, Lerp and an LFO is a good choice. Get two points, Lerp between them and then set destination as start and a neighbor point as new target. The LFO cycle number indicates when to swap the points…
Well, i suggest you to start, by studying how to get this behavior.
From my observation you have 6 ways you can move from each cell, so when your point reaches an intersection, you change direction to the next one…
As tonfilm suggested would even do better, you will select next point on tick.
To get randomness you can do some sort of fitting algorithm or grab your direction angle add random to it, make normalized vector, make from possible directions vectors and get closest possible direction or even do that on angles …
Ok thanks :) Is there a help patch on how to “sample lerp - sample” - ive looked into sample node of bezierspline and the skia svg path sample patches but they seem pretty complex. Not sure how this update loop should look in vl. ( the goal would be to have some spread of particles being added )
so ofcourse my vl patch once again looks like vvvv :) not sure how i would compare distance / select slice of my gridspread and pass on that index in vl
Since vvvv gamma 2019.2 you can use a data type as property in itself. so you could create a big data structure with all hex points and each point stores it’s neighbours, this saves the information once and you don’t have to re-calculate it in every step.
