This is… essentially a BSP tree traversal without splitting polys that straddle ... | Hacker News

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

Sharlin 9 months ago | parent | context | favorite | on: Geometric Algorithms for Translucency Sorting in M...

This is… essentially a BSP tree traversal without splitting polys that straddle a partition plane, right?

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