Open CASCADE Technology Reference Manual 8.0.0
Loading...
Searching...
No Matches
Data Structures | Public Types | Public Member Functions | Protected Member Functions
BVH_BinnedBuilder< T, N, Bins > Class Template Reference

Performs construction of BVH tree using binned SAH algorithm. Number of bins controls BVH quality in cost of construction time (greater - better). For optimal results, use 32 - 48 bins. However, reasonable performance is provided even for 4 - 8 bins (it is only 10-20% lower in comparison with optimal settings). Note that multiple threads can be used only with thread safe BVH primitive sets. More...

#include <BVH_BinnedBuilder.hxx>

Inheritance diagram for BVH_BinnedBuilder< T, N, Bins >:
Inheritance graph
[legend]

Data Structures

struct  BVH_SplitPlane
 Describes split plane candidate. More...
 

Public Types

typedef BVH_Bin< T, N > BVH_BinVector[Bins]
 Type of the array of bins of BVH tree node.
 
typedef BVH_SplitPlane BVH_SplitPlanes[Bins+1]
 Type of the array of split plane candidates.
 
- Public Types inherited from Standard_Transient
typedef void base_type
 Returns a type descriptor about this object.
 

Public Member Functions

 BVH_BinnedBuilder (const int theLeafNodeSize=BVH_Constants_LeafNodeSizeDefault, const int theMaxTreeDepth=BVH_Constants_MaxTreeDepth, const bool theDoMainSplits=false, const int theNumOfThreads=1)
 Creates binned SAH BVH builder.
 
 ~BVH_BinnedBuilder () override=default
 Releases resources of binned SAH BVH builder.
 
- Public Member Functions inherited from BVH_QueueBuilder< T, N >
 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_Transientoperator= (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_TransientThis () 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

BVH_QueueBuilder< T, N >::BVH_ChildNodes buildNode (BVH_Set< T, N > *theSet, BVH_Tree< T, N > *theBVH, const int theNode) const override
 Performs splitting of the given BVH node.
 
virtual void getSubVolumes (BVH_Set< T, N > *theSet, BVH_Tree< T, N > *theBVH, const int theNode, BVH_BinVector &theBins, const int theAxis) const
 Arranges node primitives into bins.
 
- Protected Member Functions inherited from BVH_QueueBuilder< T, N >
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.
 

Additional Inherited Members

- Static Public Member Functions inherited from Standard_Transient
static constexpr const charget_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.
 
- Protected Attributes inherited from BVH_QueueBuilder< T, N >
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.
 

Detailed Description

template<class T, int N, int Bins = BVH_Constants_NbBinsOptimal>
class BVH_BinnedBuilder< T, N, Bins >

Performs construction of BVH tree using binned SAH algorithm. Number of bins controls BVH quality in cost of construction time (greater - better). For optimal results, use 32 - 48 bins. However, reasonable performance is provided even for 4 - 8 bins (it is only 10-20% lower in comparison with optimal settings). Note that multiple threads can be used only with thread safe BVH primitive sets.

Member Typedef Documentation

◆ BVH_BinVector

template<class T , int N, int Bins = BVH_Constants_NbBinsOptimal>
typedef BVH_Bin<T, N> BVH_BinnedBuilder< T, N, Bins >::BVH_BinVector[Bins]

Type of the array of bins of BVH tree node.

◆ BVH_SplitPlanes

template<class T , int N, int Bins = BVH_Constants_NbBinsOptimal>
typedef BVH_SplitPlane BVH_BinnedBuilder< T, N, Bins >::BVH_SplitPlanes[Bins+1]

Type of the array of split plane candidates.

Constructor & Destructor Documentation

◆ BVH_BinnedBuilder()

template<class T , int N, int Bins = BVH_Constants_NbBinsOptimal>
BVH_BinnedBuilder< T, N, Bins >::BVH_BinnedBuilder ( const int theLeafNodeSize = BVH_Constants_LeafNodeSizeDefault,
const int theMaxTreeDepth = BVH_Constants_MaxTreeDepth,
const bool theDoMainSplits = false,
const int theNumOfThreads = 1 )
inline

Creates binned SAH BVH builder.

◆ ~BVH_BinnedBuilder()

template<class T , int N, int Bins = BVH_Constants_NbBinsOptimal>
BVH_BinnedBuilder< T, N, Bins >::~BVH_BinnedBuilder ( )
overridedefault

Releases resources of binned SAH BVH builder.

Member Function Documentation

◆ buildNode()

template<class T , int N, int Bins>
BVH_QueueBuilder< T, N >::BVH_ChildNodes BVH_BinnedBuilder< T, N, Bins >::buildNode ( BVH_Set< T, N > * theSet,
BVH_Tree< T, N > * theBVH,
const int theNode ) const
overrideprotectedvirtual

Performs splitting of the given BVH node.

Implements BVH_QueueBuilder< T, N >.

◆ getSubVolumes()

template<class T , int N, int Bins>
void BVH_BinnedBuilder< T, N, Bins >::getSubVolumes ( BVH_Set< T, N > * theSet,
BVH_Tree< T, N > * theBVH,
const int theNode,
BVH_BinVector & theBins,
const int theAxis ) const
protectedvirtual

Arranges node primitives into bins.


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