17 years, 2 months ago
Highlights
17 years, 2 months ago
17 years, 2 months ago
@phresnel, oliii For collision detection purposes you can approximate SAH. There's no point in building expensive since you are highly likely to rebuild your Kd-tree often anywa…
17 years, 2 months ago
Hi, a while back for one of my courses I implemented and benchmarked most of datastructures mentioned in Christer Ericson's 'Real-time collision detection' book.Kd-tree lis…
17 years, 2 months ago
You can use what's called a 'Loose Octree' (created by Thatcher Ulrich). Essentially each node in the tree is 'enlarged' a by certain amount (for example 50% in each direction).…
17 years, 2 months ago
Latest Activity
See all in Discussions@phresnel, oliii For collision detection purposes you can approximate SAH. There's no point in building expensive since you are highly …
17 years, 2 months ago
Hi, a while back for one of my courses I implemented and benchmarked most of datastructures mentioned in Christer Ericson's …
17 years, 2 months ago
You can use what's called a 'Loose Octree' (created by Thatcher Ulrich). Essentially each node in the tree is 'enlarged' …
17 years, 2 months ago