BVH_QueueBuilder< T, N > Class Template Reference

Abstract BVH builder based on the concept of work queue. Queue based BVH builders support parallelization with a fixed number of threads (maximum efficiency is achieved by setting the number of threads equal to the number of CPU cores plus one). Note that to support parallel mode, a corresponding BVH primitive set should provide thread safe implementations of interface functions (e.g., Swap, Box, Center). Otherwise, the results will be undefined. More...

#include <BVH_QueueBuilder.hxx>

Inheritance diagram for BVH_QueueBuilder< T, N >:

Data Structures
struct	BVH_PrimitiveRange
	Stores range of primitives belonging to a BVH node. More...
struct	BVH_ChildNodes
	Stores parameters of constructed child nodes. More...
class	BVH_TypedBuildTool
	Wrapper for BVH build data. More...

Public Member Functions
	BVH_QueueBuilder (const int theLeafNodeSize, const int theMaxTreeDepth, const int theNumOfThreads=1)
	Creates new BVH queue based builder.
	~BVH_QueueBuilder () override=default
	Releases resources of BVH queue based builder.
void	Build (BVH_Set< T, N > *theSet, BVH_Tree< T, N > *theBVH, const BVH_Box< T, N > &theBox) const override
	Builds BVH using specific algorithm.
Public Member Functions inherited from BVH_BuilderTransient
int	MaxTreeDepth () const
	Returns the maximum depth of constructed BVH.
int	LeafNodeSize () const
	Returns the maximum number of sub-elements in the leaf.
bool	IsParallel () const
	Returns parallel flag.
void	SetParallel (const bool isParallel)
	Set parallel flag controlling possibility of parallel execution.
Public Member Functions inherited from Standard_Transient
	Standard_Transient ()
	Empty constructor.
	Standard_Transient (const Standard_Transient &)
	Copy constructor – does nothing.
Standard_Transient &	operator= (const Standard_Transient &)
	Assignment operator, needed to avoid copying reference counter.
virtual	~Standard_Transient ()=default
	Destructor must be virtual.
virtual const opencascade::handle< Standard_Type > &	DynamicType () const
	Returns a type descriptor about this object.
bool	IsInstance (const opencascade::handle< Standard_Type > &theType) const
	Returns a true value if this is an instance of Type.
bool	IsInstance (const char *const theTypeName) const
	Returns a true value if this is an instance of TypeName.
bool	IsKind (const opencascade::handle< Standard_Type > &theType) const
	Returns true if this is an instance of Type or an instance of any class that inherits from Type. Note that multiple inheritance is not supported by OCCT RTTI mechanism.
bool	IsKind (const char *const theTypeName) const
	Returns true if this is an instance of TypeName or an instance of any class that inherits from TypeName. Note that multiple inheritance is not supported by OCCT RTTI mechanism.
Standard_Transient *	This () const
	Returns non-const pointer to this object (like const_cast). For protection against creating handle to objects allocated in stack or call from constructor, it will raise exception Standard_ProgramError if reference counter is zero.
int	GetRefCount () const noexcept
	Get the reference counter of this object.
void	IncrementRefCounter () noexcept
	Increments the reference counter of this object. Uses relaxed memory ordering since incrementing only requires atomicity, not synchronization with other memory operations.
int	DecrementRefCounter () noexcept
	Decrements the reference counter of this object; returns the decremented value. Uses release ordering for the decrement to ensure all writes to the object are visible before the count reaches zero. An acquire fence is added only when the count reaches zero, ensuring proper synchronization before deletion. This is more efficient than using acq_rel for every decrement.
virtual void	Delete () const
	Memory deallocator for transient classes.

Protected Member Functions
virtual BVH_QueueBuilder< T, N >::BVH_ChildNodes	buildNode (BVH_Set< T, N > *theSet, BVH_Tree< T, N > *theBVH, const int theNode) const =0
	Performs splitting of the given BVH node.
virtual void	addChildren (BVH_Tree< T, N > *theBVH, BVH_BuildQueue &theBuildQueue, const int theNode, const BVH_ChildNodes &theSubNodes) const
	Processes child nodes of the split BVH node.
Protected Member Functions inherited from BVH_Builder< T, N >
	BVH_Builder (const int theLeafNodeSize, const int theMaxTreeDepth)
	Creates new abstract BVH builder.
void	updateDepth (BVH_Tree< T, N > *theBVH, const int theLevel) const
	Updates depth of constructed BVH tree.
Protected Member Functions inherited from BVH_BuilderTransient
	BVH_BuilderTransient (const int theLeafNodeSize, const int theMaxTreeDepth)
	Creates new abstract BVH builder.

Protected Attributes
int	myNumOfThreads
	Number of threads used to build BVH.
Protected Attributes inherited from BVH_BuilderTransient
int	myMaxTreeDepth
	Maximum depth of constructed BVH.
int	myLeafNodeSize
	Maximum number of objects per leaf.
bool	myIsParallel
	Parallel execution flag.

Additional Inherited Members
typedef void	base_type
	Returns a type descriptor about this object.
static constexpr const char *	get_type_name ()
	Returns a type descriptor about this object.
static const opencascade::handle< Standard_Type > &	get_type_descriptor ()
	Returns type descriptor of Standard_Transient class.

Detailed Description

template<class T, int N>
class BVH_QueueBuilder< T, N >

Abstract BVH builder based on the concept of work queue. Queue based BVH builders support parallelization with a fixed number of threads (maximum efficiency is achieved by setting the number of threads equal to the number of CPU cores plus one). Note that to support parallel mode, a corresponding BVH primitive set should provide thread safe implementations of interface functions (e.g., Swap, Box, Center). Otherwise, the results will be undefined.

Template Parameters

T	Numeric data type
N	Vector dimension

Constructor & Destructor Documentation

BVH_QueueBuilder()

template<class T, int N>

BVH_QueueBuilder< T, N >::BVH_QueueBuilder ( const int theLeafNodeSize, const int theMaxTreeDepth, const int theNumOfThreads = 1 )

inline

Creates new BVH queue based builder.

~BVH_QueueBuilder()

template<class T, int N>

BVH_QueueBuilder< T, N >::~BVH_QueueBuilder ( )

overridedefault

Releases resources of BVH queue based builder.

Member Function Documentation

addChildren()

template<class T, int N>

void BVH_QueueBuilder< T, N >::addChildren ( BVH_Tree< T, N > * theBVH, BVH_BuildQueue & theBuildQueue, const int theNode, const BVH_ChildNodes & theSubNodes ) const

protectedvirtual

Processes child nodes of the split BVH node.

Build()

template<class T, int N>

void BVH_QueueBuilder< T, N >::Build ( BVH_Set< T, N > * theSet, BVH_Tree< T, N > * theBVH, const BVH_Box< T, N > & theBox ) const

overridevirtual

Builds BVH using specific algorithm.

Implements BVH_Builder< T, N >.

buildNode()

template<class T, int N>

virtual BVH_QueueBuilder< T, N >::BVH_ChildNodes BVH_QueueBuilder< T, N >::buildNode ( BVH_Set< T, N > * theSet, BVH_Tree< T, N > * theBVH, const int theNode ) const

protectedpure virtual

Performs splitting of the given BVH node.

Implemented in BVH_BinnedBuilder< T, N, Bins >, BVH_BinnedBuilder< T, N, 2 >, and BVH_SweepPlaneBuilder< T, N >.

Field Documentation

myNumOfThreads

template<class T, int N>

int BVH_QueueBuilder< T, N >::myNumOfThreads

protected

Number of threads used to build BVH.

---

The documentation for this class was generated from the following file:

• BVH_QueueBuilder.hxx