Talk:Bounding interval hierarchy

From Wikipedia, the free encyclopedia
Jump to: navigation, search
WikiProject Computer science  
WikiProject icon This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
 ???  This article has not yet received a rating on the project's quality scale.
 ???  This article has not yet received a rating on the project's importance scale.
 

Flat tree structure[edit]

Re-added the flat tree structure property. Although BIH is a binary tree, they have a flatter tree structure than KD-trees. This is also mentioned by the author. It is for the same reason as with BVH: Simply primitives are never split by the splitting planes. (Also a threshold can be set to stop subdividing the BIH, resulting in even flatter trees.) I feel the flatter tree is relevant because it leads to smaller memory requirements & bandwidth (due decrease in nodes) and decreased branching. The author also mentions that this could benefit hardware implementations. (I assume this is because it would be easier to write a stackless implementation and also again due to decreased branching). If you feel this shouldn't be in please explain here ;). Errantkid 21:06, 24 October 2006 (UTC)

General Notes[edit]

Shortened the description of non-axis aligned BIH. I feel it's a bit wordy for an overview. I think a description of numerical stability is important enough to warrant its own paragraph. I'll try to write one some time soon if I get some time (or someone else can if they want :P) Errantkid 20:04, 24 October 2006 (UTC)