Perform calculations (mostly intersection calculations) on regions of a 3D binary spatial partitioning. More...
#include <vtkBSPIntersections.h>
Detailed Description
Perform calculations (mostly intersection calculations) on regions of a 3D binary spatial partitioning.
Given an axis aligned binary spatial partitioning described by a vtkBSPCuts object, perform intersection queries on various geometric entities with regions of the spatial partitioning.
- See also:
- vtkBSPCuts vtkKdTree
Definition at line 43 of file vtkBSPIntersections.h.
Member Typedef Documentation
Reimplemented from vtkObject.
Definition at line 46 of file vtkBSPIntersections.h.
Member Enumeration Documentation
anonymous enum [protected] |
Definition at line 145 of file vtkBSPIntersections.h.
Constructor & Destructor Documentation
| vtkBSPIntersections::vtkBSPIntersections | ( | ) | [protected] |
| vtkBSPIntersections::~vtkBSPIntersections | ( | ) | [protected] |
Member Function Documentation
| virtual const char* vtkBSPIntersections::GetClassName | ( | ) | [virtual] |
Reimplemented from vtkObject.
| static int vtkBSPIntersections::IsTypeOf | ( | const char * | name | ) | [static] |
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 vtkObject.
| virtual int vtkBSPIntersections::IsA | ( | const char * | name | ) | [virtual] |
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 vtkObject.
| static vtkBSPIntersections* vtkBSPIntersections::SafeDownCast | ( | vtkObject * | o | ) | [static] |
Reimplemented from vtkObject.
| void vtkBSPIntersections::PrintSelf | ( | ostream & | os, |
| vtkIndent | indent | ||
| ) | [virtual] |
| static vtkBSPIntersections* vtkBSPIntersections::New | ( | ) | [static] |
Create an object with Debug turned off, modified time initialized to zero, and reference counting on.
Reimplemented from vtkObject.
| void vtkBSPIntersections::SetCuts | ( | vtkBSPCuts * | cuts | ) |
Define the binary spatial partitioning.
| virtual vtkBSPCuts* vtkBSPIntersections::GetCuts | ( | ) | [virtual] |
Get the bounds of the whole space (xmin, xmax, ymin, ymax, zmin, zmax) Return 0 if OK, 1 on error.
| int vtkBSPIntersections::GetNumberOfRegions | ( | ) |
The number of regions in the binary spatial partitioning
Get the spatial bounds of a particular region Return 0 if OK, 1 on error.
Get the bounds of the data within the k-d tree region, possibly smaller than the bounds of the region. Return 0 if OK, 1 on error.
Determine whether a region of the spatial decomposition intersects an axis aligned box.
| int vtkBSPIntersections::IntersectsBox | ( | int | regionId, |
| double | xmin, | ||
| double | xmax, | ||
| double | ymin, | ||
| double | ymax, | ||
| double | zmin, | ||
| double | zmax | ||
| ) |
Determine whether a region of the spatial decomposition intersects an axis aligned box.
Compute a list of the Ids of all regions that intersect the specified axis aligned box. Returns: the number of ids in the list.
| int vtkBSPIntersections::IntersectsBox | ( | int * | ids, |
| int | len, | ||
| double | x0, | ||
| double | x1, | ||
| double | y0, | ||
| double | y1, | ||
| double | z0, | ||
| double | z1 | ||
| ) |
Compute a list of the Ids of all regions that intersect the specified axis aligned box. Returns: the number of ids in the list.
| int vtkBSPIntersections::IntersectsSphere2 | ( | int | regionId, |
| double | x, | ||
| double | y, | ||
| double | z, | ||
| double | rSquared | ||
| ) |
Determine whether a region of the spatial decomposition intersects a sphere, given the center of the sphere and the square of it's radius.
| int vtkBSPIntersections::IntersectsSphere2 | ( | int * | ids, |
| int | len, | ||
| double | x, | ||
| double | y, | ||
| double | z, | ||
| double | rSquared | ||
| ) |
Compute a list of the Ids of all regions that intersect the specified sphere. The sphere is given by it's center and the square of it's radius. Returns: the number of ids in the list.
Determine whether a region of the spatial decomposition intersects the given cell. If you already know the region that the cell centroid lies in, provide that as the last argument to make the computation quicker.
Compute a list of the Ids of all regions that intersect the given cell. If you alrady know the region that the cell centroid lies in, provide that as the last argument to make the computation quicker. Returns the number of regions the cell intersects.
| virtual int vtkBSPIntersections::GetComputeIntersectionsUsingDataBounds | ( | ) | [virtual] |
When computing the intersection of k-d tree regions with other objects, we use the spatial bounds of the region. To use the tighter bound of the bounding box of the data within the region, set this variable ON. (Specifying data bounds in the vtkBSPCuts object is optional. If data bounds were not specified, this option has no meaning.)
| void vtkBSPIntersections::SetComputeIntersectionsUsingDataBounds | ( | int | c | ) |
| void vtkBSPIntersections::ComputeIntersectionsUsingDataBoundsOn | ( | ) |
| void vtkBSPIntersections::ComputeIntersectionsUsingDataBoundsOff | ( | ) |
| virtual unsigned long vtkBSPIntersections::GetRegionListBuildTime | ( | ) | [protected, virtual] |
| int vtkBSPIntersections::BuildRegionList | ( | ) | [protected] |
| vtkKdNode** vtkBSPIntersections::GetRegionList | ( | ) | [inline, protected] |
Definition at line 140 of file vtkBSPIntersections.h.
Member Data Documentation
double vtkBSPIntersections::CellBoundsCache[6] [protected] |
Definition at line 142 of file vtkBSPIntersections.h.
The documentation for this class was generated from the following file:
- dox/Filtering/vtkBSPIntersections.h
