Private Member Functions | Related Functions | List of all members
AABBCollisionNode Class Reference

#include <OPC_OptimizedTree.h>

Private Member Functions

inline_ udword GetRadius () const
 
inline_ float GetSize () const
 
inline_ float GetVolume () const
 

Related Functions

(Note that these are not member functions.)

 _BuildCollisionTree (AABBCollisionNode *linear, const udword box_id, udword &current_id, const AABBTreeNode *current_node)
 

Detailed Description

Definition at line 76 of file OPC_OptimizedTree.h.

Member Function Documentation

◆ GetRadius()

inline_ udword AABBCollisionNode::GetRadius ( ) const
inlineprivate

Definition at line 82 of file OPC_OptimizedTree.h.

◆ GetSize()

inline_ float AABBCollisionNode::GetSize ( ) const
inlineprivate

Definition at line 81 of file OPC_OptimizedTree.h.

◆ GetVolume()

inline_ float AABBCollisionNode::GetVolume ( ) const
inlineprivate

Definition at line 80 of file OPC_OptimizedTree.h.

Friends And Related Function Documentation

◆ _BuildCollisionTree()

_BuildCollisionTree ( AABBCollisionNode linear,
const udword  box_id,
udword current_id,
const AABBTreeNode current_node 
)
related

Builds an implicit tree from a standard one. An implicit tree is a complete tree (2*N-1 nodes) whose negative box pointers and primitive pointers have been made implicit, hence packing 3 pointers in one.

Layout for implicit trees: Node:

  • box
  • data (32-bits value)

if data's LSB = 1 => remaining bits are a primitive pointer else remaining bits are a P-node pointer, and N = P + 1

Parameters
linear[in] base address of destination nodes
box_id[in] index of destination node
current_id[in] current running index
current_node[in] current node from input tree

Definition at line 99 of file OPC_OptimizedTree.cpp.


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


openhrp3
Author(s): AIST, General Robotix Inc., Nakamura Lab of Dept. of Mechano Informatics at University of Tokyo
autogenerated on Wed Sep 7 2022 02:51:05