I'm wondering why they ended up using BSP as a data structure for boolean mesh o... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

3rd3 on Sept 17, 2013 | parent | context | favorite | on: GitHub announces 3D File Diffs

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 on Sept 18, 2013 | [–]

Aparently, yes: http://onlinelibrary.wiley.com/doi/10.1111/j.1467-8659.2009....

3rd3 on Sept 23, 2013 | | [–]

Just 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

sshirokov on Sept 18, 2013 | [–]

For the use case of boolean mesh ops the majority of the work is polygon splitting and clipping, something BSP trees excel at.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact