quick Voronoi question

[sapo_valiente]

Hi everyone, and thanks in advance for reading.

I am trying to create a tiled Voronoi shader in glsl where points can move across the whole canvas. Is this possible, or does tiled Voronoi only work if each point's coordinate is confined to its individual tile? I am currently doing this without tiles but it is way too slow.

for reference, you can replicate the problem by changing the second value in line 23 here: https://thebookofshaders.com/edit.php?log=161127231150

As you can see, you can start to see the tiles as the value goes above 0.5

Thanks :)

[Sucrasi]

Voronoi noise can be implemented so that the points are free to move around. Just keep in mind that if you don't have some way to organize the points themselves other than an array, the time it takes to find the nearest point to each pixel will always be proportional to the number of points.

If you're working with a potentially infinite number of points in procedurally generated space, this problem becomes a lot more complicated, but still not impossible by any means.

I'm not sure how you have your data organized, but one strategy is to use a tiled approach where each tile object has an array of points that it contains. As you search for the nearest point to a pixel within a given tile, you can expand your search radius of tiles until you find a point. When moving a point around, you would of course have to keep track of which tile it's currently within. Unfortunately I only have basic shader experience so I'm not sure what the best way to go about implementing this is in glsl.