|
![](/i/fill.gif) |
"Thorsten Froehlich" <tho### [at] trf de> wrote in message
news:3eb6b345@news.povray.org...
> In article <3eb6acc2$1@news.povray.org> , "Jaap Frank" <jjf### [at] xs4all nl>
> wrote:
>
> > Because I need a high order interpolation and I don't want to throw away
> > months of work, I've decided to build a binary tree of function that contain
> > all the array values. I estimate that it will come to around 40 thousand
> > rather small functions.
>
> Write the numbers to a PPM image. Use multiple pixels, i.e. four pixels to
> store numbers. Then write a single function to build a number out of it
> from a pattern.
This is the best solution I've got! Thanks a lot Thorsten.
> Load the image as pattern and apply the function. Now you
> have an array, and it will be really fast and consume very little memory!
>
I only have to figure out how to do this. I don't see it at the moment, but I
don't give up easily.
Jaap Frank
Post a reply to this message
|
![](/i/fill.gif) |