|
![](/i/fill.gif) |
In article <8ei### [at] triton imagico de>,
Christoph Hormann <chr### [at] gmx de> wrote:
> I feared something like that. But in many cases where the crackle
> pattern is nice to use only a relatively small area of the pattern space
> is actually evaluated. In these cases i could imagine a system like this:
>
> - initially build a BSP tree for all points within a certain area
> (possibly customizable with a parameter).
It would have to be customizeable with a parameter...POV has no way of
determining where you are going to use the pattern.
> - when a point outside this area is evaluated use the old technique.
This much could be done with the Voronoi patch. Just use an object
pattern with a box, the voronoi pattern with appropriately placed points
inside the box, and the crackle pattern outside it. Computing the right
points to get a smooth transition would be tricky though...a couple
extra functions such as hash3d() would make it easier.
> - when a certain number of points outside needed to be evaluated rebuild
> the BSP tree for a different/larger area.
This would require actual patch work. Figuring out how big the cache has
to be to make it worth having, when to rebuild it, etc...an interesting
problem.
--
Christopher James Huff <cja### [at] earthlink net>
http://home.earthlink.net/~cjameshuff/
POV-Ray TAG: <chr### [at] tag povray org>
http://tag.povray.org/
Post a reply to this message
|
![](/i/fill.gif) |