Comments (4)
There's the SAH, of course. Computing it is relatively easy (see https://github.com/madmann91/bvh/blob/master/include/bvh/parallel_reinsertion_optimization.hpp#L34). That's what the 'ParallelReinsertionOptimization' class is using to optimize the tree. Keep in mind that even though that's the 'best' measure that can be used during construction, and even though it correlates really well to performance, it's not an absolute measure of quality. There are trees with lower SAH than others that will perfom better in practice. There's this very informative paper if you are interested in quality metrics: https://research.nvidia.com/publication/quality-metrics-bounding-volume-hierarchies.
If you really need that, I can add a class that computes the SAH.
from bvh.
I'll have to give that article a read then. I don't really know what the effort is required to do this, so if it's a bit too much than I'd rather just stick with traversal time as the best metric.
from bvh.
I have added a SahBasedAlgorithm
class that allows computing the SAH of a given BVH. To use it, you first have to derive from it, and set the traversal_cost
variable to the ratio Ct/Ci
, where Ct
is the cost of traversing a node (performing a ray-node intersection), and Ci
is the cost of intersecting a primitive. I took the liberty to close this issue, but please re-open it if that does not satisfy your needs.
from bvh.
That definitely does! Thank you so much!
from bvh.
Related Issues (20)
- Identifiers near and far in bvh.h cause issues when precompiled headers are used HOT 3
- config.min_leaf_size > 1 Leads to assertion failure HOT 1
- What is the use case? is it slower than embree? HOT 1
- Cancel build +progress monitor HOT 4
- Consider adding to vcpkg HOT 1
- Ability to re-use BVH allocations? HOT 1
- Adding and Removing elements HOT 1
- Optimize node index serialization HOT 1
- Clarify what primitive data leaf nodes actually store HOT 1
- Potential bug in traversal functions HOT 1
- Possible stale pointer usage in extract_bvh()? HOT 4
- Sweep SAH builder HOT 4
- ReinsertionOptimizer sometimes gets stuck in an infinite loop HOT 16
- Updating node positions and sizes? HOT 3
- Python bindings available? HOT 3
- Fail to build C API with clang HOT 1
- warning C4267: conversion from 'size_t' to 'unsigned int', possible loss of data HOT 1
- box collision detection HOT 1
- Minor nitpick about FMA doc / comment HOT 1
- Using in a gpu context ? HOT 1
Recommend Projects
-
React
A declarative, efficient, and flexible JavaScript library for building user interfaces.
-
Vue.js
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
-
Typescript
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
-
TensorFlow
An Open Source Machine Learning Framework for Everyone
-
Django
The Web framework for perfectionists with deadlines.
-
Laravel
A PHP framework for web artisans
-
D3
Bring data to life with SVG, Canvas and HTML. 📊📈🎉
-
Recommend Topics
-
javascript
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
-
web
Some thing interesting about web. New door for the world.
-
server
A server is a program made to process requests and deliver data to clients.
-
Machine learning
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
-
Visualization
Some thing interesting about visualization, use data art
-
Game
Some thing interesting about game, make everyone happy.
Recommend Org
-
Facebook
We are working to build community through open source technology. NB: members must have two-factor auth.
-
Microsoft
Open source projects and samples from Microsoft.
-
Google
Google ❤️ Open Source for everyone.
-
Alibaba
Alibaba Open Source for everyone
-
D3
Data-Driven Documents codes.
-
Tencent
China tencent open source team.
from bvh.