In article <3d75807d@news.povray.org>, lpv### [at] gmxde says...
> implementation (I looked into the source and it seems it really currently
> is implemented as Christopher said -> see Intersect_BBox_Tree in 
> bbox.cpp).

Oops. I should have looked more carefully.
In priority_queue_insert there already is something as a sorting 
algorithm. While I don't understand exactly how it works from my quick 
look at it, it propably just does what I suggested...

Lutz-Peter

Post a reply to this message