(And you thought we were done....  :D )

So, I was pondering some practical logistics problems and analyses, and my mind
had the traveling salesman algorithm and the related Voronoi pattern bouncing
around in there, and my mind complained, "But the things you want to measure the
distance between aren't _points_!"

And then it realized: "They don't have to be!"

And so after struggling mightily to convert some 2D signed distance functions
into  something the POV-Ray function parser would allow, I then grabbed the
Voronoi code, clawed my way through structuring that to use an array of distance
functions and their parameters assigned to each "vertex" to make an SDF version
of the Voronoi pattern.   A little fiddling with the color functions for each of
the channels, and it's looking pretty interesting.

Not _as_ interesting as I had hoped - but maybe with some more eccentric SDF's
and denser arrangements.

The other interesting thing that popped out is how some of the values behave.
I certainly don't get the nice smooth SDF that IQ gets, and I'll have to keep
investigating WHY.  But also the color function that adds blue in order to
outline the shapes only seems to work on some.

Anyway, Hope you enjoy.

Post a reply to this message

Attachments:
Download 'sdf_voronoi.png' (271 KB)

Preview of image 'sdf_voronoi.png'