19#ifndef vtkBSPIntersections_h 
   20#define vtkBSPIntersections_h 
   22#include "vtkCommonDataModelModule.h"  
   25VTK_ABI_NAMESPACE_BEGIN
 
   80  int IntersectsBox(
int regionId, 
double x0, 
double x1, 
double y0, 
double y1, 
double z0, 
double z1);
 
   91    int* ids, 
int len, 
double x0, 
double x1, 
double y0, 
double y1, 
double z0, 
double z1);
 
  135  vtkGetMacro(ComputeIntersectionsUsingDataBounds, 
int);
 
  150  double CellBoundsCache[6]; 
 
  160  static int NumberOfLeafNodes(
vtkKdNode* kd);
 
  161  static void SetIDRanges(
vtkKdNode* kd, 
int& min, 
int& 
max);
 
  165  static void SetCellBounds(
vtkCell* cell, 
double* bounds);
 
  167  int IntersectsBox_(
vtkKdNode* node, 
int* ids, 
int len, 
double x0, 
double x1, 
double y0, 
double y1,
 
  168    double z0, 
double z1);
 
  170  int IntersectsSphere2_(
 
  171    vtkKdNode* node, 
int* ids, 
int len, 
double x, 
double y, 
double z, 
double rSquared);
 
  173  int IntersectsCell_(
vtkKdNode* node, 
int* ids, 
int len, 
vtkCell* cell, 
int cellRegion = -1);
 
  182  int ComputeIntersectionsUsingDataBounds;
 
This class represents an axis-aligned Binary Spatial Partitioning of a 3D space.
 
Perform calculations (mostly intersection calculations) on regions of a 3D binary spatial partitionin...
 
int IntersectsBox(int *ids, int len, double *x)
Compute a list of the Ids of all regions that intersect the specified axis aligned box.
 
int 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.
 
int IntersectsBox(int regionId, double *x)
Determine whether a region of the spatial decomposition intersects an axis aligned box.
 
vtkKdNode ** GetRegionList()
 
void SetComputeIntersectionsUsingDataBounds(int c)
 
void SetCuts(vtkBSPCuts *cuts)
Define the binary spatial partitioning.
 
int GetNumberOfRegions()
The number of regions in the binary spatial partitioning.
 
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 ...
 
void ComputeIntersectionsUsingDataBoundsOn()
 
int GetRegionBounds(int regionID, double bounds[6])
Get the spatial bounds of a particular region Return 0 if OK, 1 on error.
 
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 regionId, vtkCell *cell, int cellRegion=-1)
Determine whether a region of the spatial decomposition intersects the given cell.
 
static vtkBSPIntersections * New()
 
int IntersectsBox(int regionId, double x0, double x1, double y0, double y1, double z0, double z1)
Determine whether a region of the spatial decomposition intersects an axis aligned box.
 
~vtkBSPIntersections() override
 
void PrintSelf(ostream &os, vtkIndent indent) override
Methods invoked by print to print information about the object including superclasses.
 
int GetBounds(double *bounds)
Get the bounds of the whole space (xmin, xmax, ymin, ymax, zmin, zmax) Return 0 if OK,...
 
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.
 
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.
 
void ComputeIntersectionsUsingDataBoundsOff()
 
abstract class to specify cell behavior
 
a simple class to control print indentation
 
This class represents a single spatial region in an 3D axis aligned binary spatial partitioning.
 
abstract base class for most VTK objects
 
record modification and/or execution time
 
vtkTypeUInt32 vtkMTimeType