Open CASCADE Technology  7.1.0.beta
BVH_TreeBase< T, N > Class Template Reference

Stores parameters of bounding volume hierarchy (BVH). Bounding volume hierarchy (BVH) organizes geometric objects in the tree based on spatial relationships. Each node in the tree contains an axis-aligned bounding box of all the objects below it. Bounding volume hierarchies are used in many algorithms to support efficient operations on the sets of geometric objects, such as collision detection, ray-tracing, searching of nearest objects, and view frustum culling. More...

#include <BVH_Tree.hxx>

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

Public Types

custom data types
typedef BVH_Box< T, N >::BVH_VecNt BVH_VecNt
 

Public Member Functions

general methods
 BVH_TreeBase ()
 Creates new empty BVH tree. More...
 
virtual ~BVH_TreeBase ()
 Releases resources of BVH tree. More...
 
int Depth () const
 Returns depth (height) of BVH tree. More...
 
int Length () const
 Returns total number of BVH tree nodes. More...
 
methods for accessing individual nodes
BVH_VecNtMinPoint (const int theNodeIndex)
 Returns minimum point of the given node. More...
 
BVH_VecNtMaxPoint (const int theNodeIndex)
 Returns maximum point of the given node. More...
 
const BVH_VecNtMinPoint (const int theNodeIndex) const
 Returns minimum point of the given node. More...
 
const BVH_VecNtMaxPoint (const int theNodeIndex) const
 Returns maximum point of the given node. More...
 
int & BegPrimitive (const int theNodeIndex)
 Returns index of first primitive of the given leaf node. More...
 
int & EndPrimitive (const int theNodeIndex)
 Returns index of last primitive of the given leaf node. More...
 
int BegPrimitive (const int theNodeIndex) const
 Returns index of first primitive of the given leaf node. More...
 
int EndPrimitive (const int theNodeIndex) const
 Returns index of last primitive of the given leaf node. More...
 
int NbPrimitives (const int theNodeIndex) const
 Returns number of primitives in the given leaf node. More...
 
int & Level (const int theNodeIndex)
 Returns level (depth) of the given node. More...
 
int Level (const int theNodeIndex) const
 Returns level (depth) of the given node. More...
 
bool IsOuter (const int theNodeIndex) const
 Checks whether the given node is outer. More...
 
methods for accessing serialized tree data
BVH_Array4iNodeInfoBuffer ()
 Returns array of node data records. More...
 
const BVH_Array4iNodeInfoBuffer () const
 Returns array of node data records. More...
 
BVH::ArrayType< T, N >::Type & MinPointBuffer ()
 Returns array of node minimum points. More...
 
BVH::ArrayType< T, N >::Type & MaxPointBuffer ()
 Returns array of node maximum points. More...
 
const BVH::ArrayType< T, N >::Type & MinPointBuffer () const
 Returns array of node minimum points. More...
 
const BVH::ArrayType< T, N >::Type & MaxPointBuffer () const
 Returns array of node maximum points. More...
 

Data Fields

protected fields
BVH_Array4i myNodeInfoBuffer
 Array of node data records. More...
 
BVH::ArrayType< T, N >::Type myMinPointBuffer
 Array of node minimum points. More...
 
BVH::ArrayType< T, N >::Type myMaxPointBuffer
 Array of node maximum points. More...
 
int myDepth
 Current depth of BVH tree (set by builder). More...
 

Detailed Description

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

Stores parameters of bounding volume hierarchy (BVH). Bounding volume hierarchy (BVH) organizes geometric objects in the tree based on spatial relationships. Each node in the tree contains an axis-aligned bounding box of all the objects below it. Bounding volume hierarchies are used in many algorithms to support efficient operations on the sets of geometric objects, such as collision detection, ray-tracing, searching of nearest objects, and view frustum culling.

Member Typedef Documentation

template<class T, int N>
typedef BVH_Box<T, N>::BVH_VecNt BVH_TreeBase< T, N >::BVH_VecNt

Constructor & Destructor Documentation

template<class T, int N>
BVH_TreeBase< T, N >::BVH_TreeBase ( )
inline

Creates new empty BVH tree.

template<class T, int N>
virtual BVH_TreeBase< T, N >::~BVH_TreeBase ( )
virtual

Releases resources of BVH tree.

Member Function Documentation

template<class T, int N>
int& BVH_TreeBase< T, N >::BegPrimitive ( const int  theNodeIndex)
inline

Returns index of first primitive of the given leaf node.

template<class T, int N>
int BVH_TreeBase< T, N >::BegPrimitive ( const int  theNodeIndex) const
inline

Returns index of first primitive of the given leaf node.

template<class T, int N>
int BVH_TreeBase< T, N >::Depth ( ) const
inline

Returns depth (height) of BVH tree.

template<class T, int N>
int& BVH_TreeBase< T, N >::EndPrimitive ( const int  theNodeIndex)
inline

Returns index of last primitive of the given leaf node.

template<class T, int N>
int BVH_TreeBase< T, N >::EndPrimitive ( const int  theNodeIndex) const
inline

Returns index of last primitive of the given leaf node.

template<class T, int N>
bool BVH_TreeBase< T, N >::IsOuter ( const int  theNodeIndex) const
inline

Checks whether the given node is outer.

template<class T, int N>
int BVH_TreeBase< T, N >::Length ( void  ) const
inline

Returns total number of BVH tree nodes.

template<class T, int N>
int& BVH_TreeBase< T, N >::Level ( const int  theNodeIndex)
inline

Returns level (depth) of the given node.

template<class T, int N>
int BVH_TreeBase< T, N >::Level ( const int  theNodeIndex) const
inline

Returns level (depth) of the given node.

template<class T, int N>
BVH_VecNt& BVH_TreeBase< T, N >::MaxPoint ( const int  theNodeIndex)
inline

Returns maximum point of the given node.

template<class T, int N>
const BVH_VecNt& BVH_TreeBase< T, N >::MaxPoint ( const int  theNodeIndex) const
inline

Returns maximum point of the given node.

template<class T, int N>
BVH::ArrayType<T, N>::Type& BVH_TreeBase< T, N >::MaxPointBuffer ( )
inline

Returns array of node maximum points.

template<class T, int N>
const BVH::ArrayType<T, N>::Type& BVH_TreeBase< T, N >::MaxPointBuffer ( ) const
inline

Returns array of node maximum points.

template<class T, int N>
BVH_VecNt& BVH_TreeBase< T, N >::MinPoint ( const int  theNodeIndex)
inline

Returns minimum point of the given node.

template<class T, int N>
const BVH_VecNt& BVH_TreeBase< T, N >::MinPoint ( const int  theNodeIndex) const
inline

Returns minimum point of the given node.

template<class T, int N>
BVH::ArrayType<T, N>::Type& BVH_TreeBase< T, N >::MinPointBuffer ( )
inline

Returns array of node minimum points.

template<class T, int N>
const BVH::ArrayType<T, N>::Type& BVH_TreeBase< T, N >::MinPointBuffer ( ) const
inline

Returns array of node minimum points.

template<class T, int N>
int BVH_TreeBase< T, N >::NbPrimitives ( const int  theNodeIndex) const
inline

Returns number of primitives in the given leaf node.

template<class T, int N>
BVH_Array4i& BVH_TreeBase< T, N >::NodeInfoBuffer ( )
inline

Returns array of node data records.

template<class T, int N>
const BVH_Array4i& BVH_TreeBase< T, N >::NodeInfoBuffer ( ) const
inline

Returns array of node data records.

Field Documentation

template<class T, int N>
int BVH_TreeBase< T, N >::myDepth

Current depth of BVH tree (set by builder).

template<class T, int N>
BVH::ArrayType<T, N>::Type BVH_TreeBase< T, N >::myMaxPointBuffer

Array of node maximum points.

template<class T, int N>
BVH::ArrayType<T, N>::Type BVH_TreeBase< T, N >::myMinPointBuffer

Array of node minimum points.

template<class T, int N>
BVH_Array4i BVH_TreeBase< T, N >::myNodeInfoBuffer

Array of node data records.


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