TORCS  1.3.9
The Open Racing Car Simulator
BBoxTree.cpp File Reference
#include "BBoxTree.h"
#include "Transform.h"
#include <algorithm>
#include <new>
Include dependency graph for BBoxTree.cpp:

Go to the source code of this file.

Classes

class  BBoxCompAxis
 

Functions

bool sep_axes_test (const Vector &a, const Vector &b, const Matrix &abs_b2a, const Vector &pos_b2a, const Matrix &abs_a2b, const Vector &pos_a2b)
 
bool intersect (const BBox &a, const BBox &b, const Transform &b2a, const Matrix &abs_b2a, const Transform &a2b, const Matrix &abs_a2b)
 
bool intersect (const BBoxNode *tree, const Convex &c, const BBox &bb, const Transform &b2a, Vector &v)
 
bool intersect (const BBoxNode *a, const BBoxNode *b, const Transform &b2a, const Matrix &abs_b2a, const Transform &a2b, const Matrix &abs_a2b, Vector &v)
 
bool find_prim (const BBoxNode *tree, const Convex &c, const BBox &bb, const Transform &b2a, Vector &v, ShapePtr &p)
 
bool find_prim (const BBoxNode *a, const BBoxNode *b, const Transform &b2a, const Matrix &abs_b2a, const Transform &a2b, const Matrix &abs_a2b, Vector &v, ShapePtr &pa, ShapePtr &pb)
 
bool common_point (const BBoxNode *tree, const Convex &c, const BBox &bb, const Transform &b2a, Vector &v, Point &pa, Point &pb)
 
bool common_point (const BBoxNode *a, const BBoxNode *b, const Transform &b2a, const Matrix &abs_b2a, const Transform &a2b, const Matrix &abs_a2b, Vector &v, Point &pa, Point &pb)
 

Variables

class BBoxCompAxis bboxCompAxis [3] = { X, Y, Z }
 
BBoxInternalfree_node
 

Function Documentation

◆ common_point() [1/2]

bool common_point ( const BBoxNode tree,
const Convex c,
const BBox bb,
const Transform b2a,
Vector v,
Point pa,
Point pb 
)

Definition at line 204 of file BBoxTree.cpp.

Here is the call graph for this function:

◆ common_point() [2/2]

bool common_point ( const BBoxNode a,
const BBoxNode b,
const Transform b2a,
const Matrix abs_b2a,
const Transform a2b,
const Matrix abs_a2b,
Vector v,
Point pa,
Point pb 
)

Definition at line 217 of file BBoxTree.cpp.

Here is the call graph for this function:

◆ find_prim() [1/2]

bool find_prim ( const BBoxNode tree,
const Convex c,
const BBox bb,
const Transform b2a,
Vector v,
ShapePtr p 
)

Definition at line 154 of file BBoxTree.cpp.

Here is the call graph for this function:

◆ find_prim() [2/2]

bool find_prim ( const BBoxNode a,
const BBoxNode b,
const Transform b2a,
const Matrix abs_b2a,
const Transform a2b,
const Matrix abs_a2b,
Vector v,
ShapePtr pa,
ShapePtr pb 
)

Definition at line 172 of file BBoxTree.cpp.

Here is the call graph for this function:

◆ intersect() [1/3]

bool intersect ( const BBox a,
const BBox b,
const Transform b2a,
const Matrix abs_b2a,
const Transform a2b,
const Matrix abs_a2b 
)
inline

Definition at line 105 of file BBoxTree.cpp.

Here is the call graph for this function:

◆ intersect() [2/3]

bool intersect ( const BBoxNode tree,
const Convex c,
const BBox bb,
const Transform b2a,
Vector v 
)

Definition at line 115 of file BBoxTree.cpp.

Here is the call graph for this function:

◆ intersect() [3/3]

bool intersect ( const BBoxNode a,
const BBoxNode b,
const Transform b2a,
const Matrix abs_b2a,
const Transform a2b,
const Matrix abs_a2b,
Vector v 
)

Definition at line 128 of file BBoxTree.cpp.

Here is the call graph for this function:

◆ sep_axes_test()

bool sep_axes_test ( const Vector a,
const Vector b,
const Matrix abs_b2a,
const Vector pos_b2a,
const Matrix abs_a2b,
const Vector pos_a2b 
)
inline

Definition at line 87 of file BBoxTree.cpp.

Here is the call graph for this function:

Variable Documentation

◆ bboxCompAxis

class BBoxCompAxis bboxCompAxis[3] = { X, Y, Z }

◆ free_node

BBoxInternal* free_node

Definition at line 37 of file Complex.cpp.