|
EBGeometry
Compact, header-only C++ library for fast evaluation of signed distance functions
|
Configuration for the ClusterSAH direct PackedBVH construction path. More...
#include <EBGeometry_BVH.hpp>
Public Attributes | |
| size_t | maxClusterSize = 8 |
| Maximum primitives per cluster (the leaf/bucket granularity). Must be > 0. | |
Configuration for the ClusterSAH direct PackedBVH construction path.
ClusterSAH first groups primitives into small, spatially-tight clusters (buckets of at most maxClusterSize primitives, formed by a cheap density-adaptive midpoint subdivision that stops early), then runs binned SAH top-down over the clusters – so SAH partitions ~N/maxClusterSize boxes instead of all N primitives. The result is a near-SAH-quality tree at a fraction of the single-threaded build cost, robust across uniform, surface, and clustered primitive distributions (unlike a fixed Cartesian grid, which overcrowds on non-uniform data). maxClusterSize trades build time (larger -> fewer, cheaper SAH units, faster build) against query quality (larger -> coarser leaves).