#include <vtkBSPIntersections.h>
Inheritance diagram for vtkBSPIntersections:
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.
Definition at line 43 of file vtkBSPIntersections.h.
Public Types | |
typedef vtkObject | Superclass |
Public Member Functions | |
virtual const char * | GetClassName () |
virtual int | IsA (const char *type) |
void | PrintSelf (ostream &os, vtkIndent indent) |
void | SetCuts (vtkBSPCuts *cuts) |
virtual vtkBSPCuts * | GetCuts () |
int | GetBounds (double *bounds) |
int | GetNumberOfRegions () |
int | GetRegionBounds (int regionID, double bounds[6]) |
int | IntersectsCell (int regionId, vtkCell *cell, int cellRegion=-1) |
int | IntersectsCell (int *ids, int len, vtkCell *cell, int cellRegion=-1) |
virtual int | GetComputeIntersectionsUsingDataBounds () |
void | SetComputeIntersectionsUsingDataBounds (int c) |
void | ComputeIntersectionsUsingDataBoundsOn () |
void | ComputeIntersectionsUsingDataBoundsOff () |
int | GetRegionDataBounds (int regionID, double bounds[6]) |
int | IntersectsBox (int regionId, double *x) |
int | IntersectsBox (int regionId, double xmin, double xmax, double ymin, double ymax, double zmin, double zmax) |
int | IntersectsBox (int *ids, int len, double *x) |
int | IntersectsBox (int *ids, int len, double x0, double x1, double y0, double y1, double z0, double z1) |
int | IntersectsSphere2 (int regionId, double x, double y, double z, double rSquared) |
int | IntersectsSphere2 (int *ids, int len, double x, double y, double z, double rSquared) |
Static Public Member Functions | |
static int | IsTypeOf (const char *type) |
static vtkBSPIntersections * | SafeDownCast (vtkObject *o) |
static vtkBSPIntersections * | New () |
Protected Types | |
enum | { XDIM = 0, YDIM = 1, ZDIM = 2 } |
Protected Member Functions | |
vtkBSPIntersections () | |
~vtkBSPIntersections () | |
virtual unsigned long | GetRegionListBuildTime () |
int | BuildRegionList () |
vtkKdNode ** | GetRegionList () |
Protected Attributes | |
double | CellBoundsCache [6] |
|
Reimplemented from vtkObject. Definition at line 46 of file vtkBSPIntersections.h. |
|
Definition at line 145 of file vtkBSPIntersections.h. |
|
|
|
|
|
Reimplemented from vtkObject. |
|
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 vtkTypeRevisionMacro found in vtkSetGet.h. Reimplemented from vtkObject. |
|
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 vtkTypeRevisionMacro found in vtkSetGet.h. Reimplemented from vtkObject. |
|
Reimplemented from vtkObject. |
|
Methods invoked by print to print information about the object including superclasses. Typically not called by the user (use Print() instead) but used in the hierarchical print process to combine the output of several classes. Reimplemented from vtkObject. |
|
Create an object with Debug turned off, modified time initialized to zero, and reference counting on. Reimplemented from vtkObject. |
|
Define the binary spatial partitioning. |
|
|
|
Get the bounds of the whole space (xmin, xmax, ymin, ymax, zmin, zmax) Return 0 if OK, 1 on error. |
|
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. |
|
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. |
|
Compute a list of the Ids of all regions that intersect the specified axis aligned box. Returns: the number of ids in the list. |
|
Compute a list of the Ids of all regions that intersect the specified axis aligned box. Returns: the number of ids in the list. |
|
Determine whether a region of the spatial decomposition intersects a sphere, given the center of the sphere and the square of it's radius. |
|
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. |
|
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.) |
|
|
|
|
|
|
|
|
|
|
|
Definition at line 140 of file vtkBSPIntersections.h. |
|
Definition at line 142 of file vtkBSPIntersections.h. |