Age | Commit message (Collapse) | Author |
|
order to ensure the process terminates.
|
|
|
|
|
|
This is an adaptation of the original Chroma BVH construction algorithm.
The generation stage is very slow, but can be fixed.
|
|
parent nodes if combining them would result in a parent node that is
excessively large compared to the surface area of the children.
This doesn't help as much as you might imagine.
|
|
|
|
minimization
|
|
* chroma-bvh create [name] [degree] - Creates a new BVH with the specified
branching degree.
* chroma-bvh node_swap [name] [layer] - Optimizes a BVH layer with a
"greedy, short-sighted" algorithm that swaps around nodes to minimize
the surface area of the immediate parent layer. Rebuilds the tree
above the modified layer when finished.
Also modified the chroma-bvh stat command to print the sum of the
logarithms of the areas of each layer. It seems to be a rough
predictor of the simulation speed of the BVH.
|
|
|