BinaryUint32BVH
Classes
Memory-efficient LBVH implementation. LBVH is fast to build, is quite fast to query and has good memory usage due to implicit addressing. LBVH is static, so it's not suitable for dynamic usecases, if your usecase requires updates to the BVH - use BVH instead, which is a fully dynamic BVH implementation.
Constants
-
BVH_BOX_BYTE_SIZE :
number -
BVH_BINARY_NODE_SIZE :
number
In words (4 byte)
- BVH_LEAF_NODE_SIZE :
number
Functions
Assumes data will be normalized to 0...1 value range
BVH_BOX_BYTE_SIZE : number
Kind: global constant
Read only: true
BVH_BINARY_NODE_SIZE : number
In words (4 byte)
Kind: global constant
Read only: true
BVH_LEAF_NODE_SIZE : number
Kind: global constant
Read only: true
copy_box_zero_size(data, destination, source)
Kind: global function
| Param | Type |
|---|---|
| data | Float32Array |
| destination | number |
| source | number |
build_morton(data, address, bounds) ⇒ number
Assumes data will be normalized to 0...1 value range
Kind: global function
| Param | Type |
|---|---|
| data | Float32Array |
| address | number |
| bounds | Array.<number> |