In article <On+tOPJBpDTW19hVUhYU9Bh3Vtgf@4ax.com>, Peter Popov 
<pet### [at] usanet> wrote:

> An oct-tree is built recursively by splitting each bounding box in
> eight smaller parts, right? How are the three splitting planes
> determined? Is the midpoint of the bounding box used or is an adaptive
> median approach used?

I wouldn't know, I know very little about bounding structures. I only 
know what the most basic form of an oct-tree is.


> The latter would yield a much more efficient bounding scheme but the 
> overhead in parse time would almost surely render any benefits in 
> render time unsibstantial. If this is implemented in a POV script 
> generating external program, such as PlantStudio or TreeDesigner or a 
> particle system this should not be much of a problem.

Is this a disguised hint for a feature in my particle simulator? :-)

-- 
Chris Huff
e-mail: chr### [at] yahoocom
Web page: http://chrishuff.dhs.org/

Post a reply to this message