3 ms·
I'm wondering why they ended up using BSP as a data structure for boolean mesh operations. Is there an advantage over Octrees I'm not aware of in this case?
by 3rd3 13y ago
I'm wondering why they ended up using BSP as a data structure for boolean mesh operations. Is there an advantage over Octrees I'm not aware of in this case?
- 3rd3 13y agoAparently, yes: http://onlinelibrary.wiley.com/doi/10.1111/j.1467-8659.2009.01609.x/abstract http://onlinelibrary.wiley.com/doi/10.1111/j.1467-8659.2009....
- 3rd3 13y agoJust for the record: The original paper in which they found that merging the trees of binary space partition yields set operations: http://www.cse.yorku.ca/~amana/research/bsptSetOp.pdf http://www.cse.yorku.ca/~amana/research/bsptSetOp.pdf
- sshirokov 13y agoFor the use case of boolean mesh ops the majority of the work is polygon splitting and clipping, something BSP trees excel at.