Go to the documentation of this file.
13 #ifndef OPENHRP_COLDET_MODEL_SHARED_DATA_SET_H_INCLUDED
14 #define OPENHRP_COLDET_MODEL_SHARED_DATA_SET_H_INCLUDED
35 triangles[0] = triangles[1] = triangles[2] = -1;
38 for(
int i=0;
i < 3; ++
i){
40 triangles[
i] = neighbor;
46 for(
int i=0;
i<3;
i++){
47 if(triangles[
i]==neighbor){
48 for(
int j=
i+1; j<3; j++){
49 triangles[j-1] = triangles[j];
56 int operator[](
int index)
const {
return triangles[index]; }
79 return AABBTreeMaxDepth;
82 return numBBMap.at(depth);
85 if(AABBTreeMaxDepth>0)
86 return numBBMap.at(AABBTreeMaxDepth-1);
96 int computeDepth(
const Opcode::AABBCollisionNode* node,
int currentDepth,
int max );
ColdetModel::PrimitiveType pType
std::vector< int > numBBMap
vector< IceMaths::Point > vertices
static int max(int a, int b)
std::vector< int > numLeafMap
void deleteNeighbor(int neighbor)
Opcode::MeshInterface iMesh
vector< IceMaths::IndexedTriangle > triangles
std::vector< NeighborTriangleSet > NeighborTriangleSetArray
NeighborTriangleSetArray neighbor
int getNumofBB(int depth)
std::vector< float > pParams
int operator[](int index) const
void addNeighbor(int neighbor)
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:02