Go to the documentation of this file.
34 #ifndef vtkBSPIntersections_h
35 #define vtkBSPIntersections_h
37 #include "vtkCommonDataModelModule.h"
95 double ymin,
double ymax,
96 double zmin,
double zmax);
107 double y0,
double y1,
double z0,
double z1);
116 double x,
double y,
double z,
double rSquared);
125 double x,
double y,
double z,
double rSquared);
153 vtkGetMacro(ComputeIntersectionsUsingDataBounds,
int);
169 double CellBoundsCache[6];
179 static int NumberOfLeafNodes(
vtkKdNode *kd);
180 static void SetIDRanges(
vtkKdNode *kd,
int &min,
int &
max);
184 static void SetCellBounds(
vtkCell *cell,
double *bounds);
186 int _IntersectsBox(
vtkKdNode *node,
int *ids,
int len,
187 double x0,
double x1,
188 double y0,
double y1,
189 double z0,
double z1);
191 int _IntersectsSphere2(
vtkKdNode *node,
int *ids,
int len,
192 double x,
double y,
double z,
double rSquared);
194 int _IntersectsCell(
vtkKdNode *node,
int *ids,
int len,
195 vtkCell *cell,
int cellRegion=-1);
204 int ComputeIntersectionsUsingDataBounds;
void PrintSelf(ostream &os, vtkIndent indent) override
Methods invoked by print to print information about the object including superclasses.
This class represents a single spatial region in an 3D axis aligned binary spatial partitioning....
void ComputeIntersectionsUsingDataBoundsOn()
int 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 ...
~vtkBSPIntersections() override
void SetComputeIntersectionsUsingDataBounds(int c)
int IntersectsCell(int regionId, vtkCell *cell, int cellRegion=-1)
Determine whether a region of the spatial decomposition intersects the given cell.
int IntersectsBox(int regionId, double xmin, double xmax, double ymin, double ymax, double zmin, double zmax)
static vtkBSPIntersections * New()
record modification and/or execution time
abstract base class for most VTK objects
void ComputeIntersectionsUsingDataBoundsOff()
int IntersectsBox(int *ids, int len, double x0, double x1, double y0, double y1, double z0, double z1)
Perform calculations (mostly intersection calculations) on regions of a 3D binary spatial partitionin...
vtkKdNode ** GetRegionList()
abstract class to specify cell behavior
a simple class to control print indentation
int GetNumberOfRegions()
The number of regions in the binary spatial partitioning.
This class represents an axis-aligned Binary Spatial Partitioning of a 3D space.
int GetRegionBounds(int regionID, double bounds[6])
Get the spatial bounds of a particular region Return 0 if OK, 1 on error.
int IntersectsBox(int *ids, int len, double *x)
Compute a list of the Ids of all regions that intersect the specified axis aligned box.
void SetCuts(vtkBSPCuts *cuts)
Define the binary spatial partitioning.
int IntersectsBox(int regionId, double *x)
Determine whether a region of the spatial decomposition intersects an axis aligned box.
int GetBounds(double *bounds)
Get the bounds of the whole space (xmin, xmax, ymin, ymax, zmin, zmax) Return 0 if OK,...
int 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.
int GetRegionDataBounds(int regionID, double bounds[6])
Get the bounds of the data within the k-d tree region, possibly smaller than the bounds of the region...
int IntersectsCell(int *ids, int len, vtkCell *cell, int cellRegion=-1)
Compute a list of the Ids of all regions that intersect the given cell.
vtkTypeUInt32 vtkMTimeType