Bvh::Node

BVH node container. More...

#include <bvh.hpp>

Public Member Functions
uint32	getPrimitiveCount () const noexcept
	Returns this leaf BVH node primitive count.
void	setPrimitiveCount (uint32 primitiveCount) noexcept
	Sets this leaf BVH node primitive count.
uint32	getLeftNode () const noexcept
	Returns this BVH node left child node identifier.
void	setLeftNode (uint32 nodeID) noexcept
	Sets this BVH node left child node identifier.
uint32	getFirstPrimitive () const noexcept
	Returns this leaf BVH node first primitive index.
void	setFirstPrimitive (uint32 primitiveIndex) noexcept
	Sets this leaf BVH node first primitive index.
bool	isLeaf () const noexcept
	Returns true if this is leaf node. (Contain the actual geometric objects)

Public Attributes
Aabb	aabb = {}

Detailed Description

BVH node container.

The "hierarchy" in BVH refers to the tree structure of bounding volumes. Each internal node in the tree represents a bounding volume that contains other, smaller bounding volumes (either other internal nodes or leaf nodes). The leaf nodes of the tree contain the actual geometric objects (e.g., triangles in a 3D model).

Member Function Documentation

setPrimitiveCount()

void setPrimitiveCount ( uint32 primitiveCount )

inlinenoexcept

Sets this leaf BVH node primitive count.

Parameters

primitiveCount

target leaf node primitive count

setLeftNode()

void setLeftNode ( uint32 nodeID )

inlinenoexcept

Sets this BVH node left child node identifier.

Parameters

nodeID

target node left child node identifier

setFirstPrimitive()

void setFirstPrimitive ( uint32 primitiveIndex )

inlinenoexcept

Sets this leaf BVH node first primitive index.

Parameters

primitiveIndex

target node first primitive index