#include <vtkOBBTree.h>
Inheritance diagram for vtkOBBTree:
Public Methods | |
virtual const char * | GetClassName () |
virtual int | IsA (const char *type) |
void | ComputeOBB (vtkPoints *pts, float corner[3], float max[3], float mid[3], float min[3], float size[3]) |
void | ComputeOBB (vtkDataSet *input, float corner[3], float max[3], float mid[3], float min[3], float size[3]) |
int | IntersectWithLine (float a0[3], float a1[3], float tol, float &t, float x[3], float pcoords[3], int &subId) |
int | IntersectWithLine (float a0[3], float a1[3], float tol, float &t, float x[3], float pcoords[3], int &subId, int &cellId) |
int | IntersectWithLine (float a0[3], float a1[3], float tol, float &t, float x[3], float pcoords[3], int &subId, int &cellId, vtkGenericCell *cell) |
int | DisjointOBBNodes (vtkOBBNode *nodeA, vtkOBBNode *nodeB, vtkMatrix4x4 *XformBtoA) |
int | LineIntersectsNode (vtkOBBNode *pA, float B0[3], float B1[3]) |
int | TriangleIntersectsNode (vtkOBBNode *pA, float p0[3], float p1[3], float p2[3], vtkMatrix4x4 *XformBtoA) |
int | IntersectWithOBBTree (vtkOBBTree *OBBTreeB, vtkMatrix4x4 *XformBtoA, int(*function)(vtkOBBNode *nodeA, vtkOBBNode *nodeB, vtkMatrix4x4 *Xform, void *arg), void *data_arg) |
void | FreeSearchStructure () |
void | BuildLocator () |
void | GenerateRepresentation (int level, vtkPolyData *pd) |
Static Public Methods | |
int | IsTypeOf (const char *type) |
vtkOBBTree * | SafeDownCast (vtkObject *o) |
vtkOBBTree * | New () |
Protected Methods | |
vtkOBBTree () | |
~vtkOBBTree () | |
vtkOBBTree (const vtkOBBTree &) | |
void | operator= (const vtkOBBTree &) |
void | ComputeOBB (vtkIdList *cells, float corner[3], float max[3], float mid[3], float min[3], float size[3]) |
void | BuildTree (vtkIdList *cells, vtkOBBNode *parent, int level) |
void | DeleteTree (vtkOBBNode *OBBptr) |
void | GeneratePolygons (vtkOBBNode *OBBptr, int level, int repLevel, vtkPoints *pts, vtkCellArray *polys) |
Protected Attributes | |
vtkOBBNode * | Tree |
vtkPoints * | PointsList |
int * | InsertedPoints |
int | OBBCount |
int | DeepestLevel |
To build the OBB, a recursive, top-down process is used. First, the root OBB is constructed by finding the mean and covariance matrix of the cells (and their points) that define the dataset. The eigenvectors of the covariance matrix are extracted, giving a set of three orthogonal vectors that define the tightest-fitting OBB. To create the two children OBB's, a split plane is found that (approximately) divides the number cells in half. These are then assigned to the children OBB's. This process then continues until the MaxLevel ivar limits the recursion, or no split plane can be found.
A good reference for OBB-trees is Gottschalk & Manocha in Proceedings of Siggraph `96.
Definition at line 111 of file vtkOBBTree.h.
|
|
|
|
|
Definition at line 187 of file vtkOBBTree.h. |
|
Return the class name as a string. This method is defined in all subclasses of vtkObject with the vtkTypeMacro found in vtkSetGet.h. Reimplemented from vtkCellLocator. |
|
Return 1 if this class type is the same type of (or a subclass of) the named class. Returns 0 otherwise. This method works in combination with vtkTypeMacro found in vtkSetGet.h. Reimplemented from vtkCellLocator. |
|
Return 1 if this class is the same type of (or a subclass of) the named class. Returns 0 otherwise. This method works in combination with vtkTypeMacro found in vtkSetGet.h. Reimplemented from vtkCellLocator. |
|
Will cast the supplied object to vtkObject* is this is a safe operation (i.e., a safe downcast); otherwise NULL is returned. This method is defined in all subclasses of vtkObject with the vtkTypeMacro found in vtkSetGet.h. Reimplemented from vtkCellLocator. |
|
Construct with automatic computation of divisions, averaging 25 cells per octant. Reimplemented from vtkCellLocator. |
|
Compute an OBB from the list of points given. Return the corner point and the three axes defining the orientation of the OBB. Also return a sorted list of relative "sizes" of axes for comparison purposes. |
|
Compute an OBB for the input dataset using the cells in the data. Return the corner point and the three axes defining the orientation of the OBB. Also return a sorted list of relative "sizes" of axes for comparison purposes. |
|
Return intersection point (if any) of finite line with cells contained in cell locator. Reimplemented from vtkCellLocator. |
|
Return intersection point (if any) AND the cell which was intersected by the finite line. Reimplemented from vtkCellLocator. |
|
Return intersection point (if any) AND the cell which was intersected by the finite line. The cell is returned as a cell id and as a generic cell. Reimplemented from vtkCellLocator. |
|
Returns true if nodeB and nodeA are disjoint after optional transformation of nodeB with matrix XformBtoA BTX |
|
Returns true if line intersects node. |
|
Returns true if triangle (optionally transformed) intersects node. |
|
For each intersecting leaf node pair, call function. OBBTreeB is optionally transformed by XformBtoA before testing. |
|
Satisfy locator's abstract interface, see vtkLocator. Reimplemented from vtkCellLocator. |
|
Build the locator from the input dataset. Reimplemented from vtkCellLocator. |
|
Create polygonal representation for OBB tree at specified level. If level < 0, then the leaf OBB nodes will be gathered. The aspect ratio (ar) and line diameter (d) are used to control the building of the representation. If a OBB node edge ratio's are greater than ar, then the dimension of the OBB is collapsed (OBB->plane->line). A "line" OBB will be represented either as two crossed polygons, or as a line, depending on the relative diameter of the OBB compared to the diameter (d). Reimplemented from vtkCellLocator. |
|
Definition at line 188 of file vtkOBBTree.h. |
|
|
|
|
|
|
|
|
|
Reimplemented from vtkCellLocator. Definition at line 196 of file vtkOBBTree.h. |
|
Definition at line 198 of file vtkOBBTree.h. |
|
Definition at line 199 of file vtkOBBTree.h. |
|
Definition at line 200 of file vtkOBBTree.h. |
|
Definition at line 201 of file vtkOBBTree.h. |