Chris Huff wrote:
> 
> Well, it takes a lot more computational work to check against hundreds
> of spheres than to check against a couple boxes or planes. You might be
> able to help with this by using a nested bounding structure, you know
> what a quad-tree is? Basically, divide each wall of spheres into four
> unions, bounded individually. Divide those unions further into four
> each, bounded individually...etc. This will allow POV to skip testing
> the bounding boxes for most of the spheres. You will have to tell POV
> not to ignore your bounding, though, and you probably won't be able to
> use while loops to generate the walls, though they would be easy to do
> with a recursive macro.
> 

Sounds like an interesting idea, i also had such problems in my recent
superellipsoid scene, i just wonder how much faster it would be (anyone
experience with such structures?)

Christoph

-- 
Christoph Hormann <chr### [at] gmxde>
Homepage: http://www.schunter.etc.tu-bs.de/~chris/

Post a reply to this message