| /dports/math/vtk6/VTK-6.2.0/Common/DataModel/ |
| H A D | vtkBSPIntersections.h | 83 int IntersectsBox(int regionId, double *x);
84 int IntersectsBox(int regionId, double xmin, double xmax,
92 int IntersectsBox(int *ids, int len, double *x);
93 int IntersectsBox(int *ids, int len, double x0, double x1,
|
| H A D | vtkBSPIntersections.cxx | 261 int vtkBSPIntersections::IntersectsBox(int regionId, double *x) in IntersectsBox() function in vtkBSPIntersections
263 return this->IntersectsBox(regionId, x[0], x[1], x[2], x[3], x[4], x[5]); in IntersectsBox()
267 int vtkBSPIntersections::IntersectsBox(int regionId, double x0, double x1, in IntersectsBox() function in vtkBSPIntersections
274 return node->IntersectsBox(x0, x1, y0, y1, z0, z1, in IntersectsBox()
279 int vtkBSPIntersections::IntersectsBox(int *ids, int len, double *x) in IntersectsBox() function in vtkBSPIntersections
281 return this->IntersectsBox(ids, len, x[0], x[1], x[2], x[3], x[4], x[5]); in IntersectsBox()
285 int vtkBSPIntersections::IntersectsBox(int *ids, int len, in IntersectsBox() function in vtkBSPIntersections
309 result = node->IntersectsBox(x0, x1, y0, y1, z0, z1, in _IntersectsBox()
|
| H A D | vtkKdNode.h | 160 int IntersectsBox(double x1,double x2,double y1,double y2,double z1,double z2,
|
| H A D | vtkKdNode.cxx | 554 int vtkKdNode::IntersectsBox(double x0, double x1, double y0, double y1, in IntersectsBox() function in vtkKdNode
743 if (!this->IntersectsBox(cellBounds[0], cellBounds[1], in IntersectsCell()
|
| H A D | vtkKdTree.cxx | 2090 int nRegions = this->BSPCalculator->IntersectsBox(regionIds, this->NumberOfRegions, box); in SearchNeighborsForDuplicate()
|
| /dports/math/vtk8/VTK-8.2.0/Common/DataModel/ |
| H A D | vtkBSPIntersections.h | 93 int IntersectsBox(int regionId, double *x);
94 int IntersectsBox(int regionId, double xmin, double xmax,
105 int IntersectsBox(int *ids, int len, double *x);
106 int IntersectsBox(int *ids, int len, double x0, double x1,
|
| H A D | vtkBSPIntersections.cxx | 261 int vtkBSPIntersections::IntersectsBox(int regionId, double *x) in IntersectsBox() function in vtkBSPIntersections
263 return this->IntersectsBox(regionId, x[0], x[1], x[2], x[3], x[4], x[5]); in IntersectsBox()
267 int vtkBSPIntersections::IntersectsBox(int regionId, double x0, double x1, in IntersectsBox() function in vtkBSPIntersections
274 return node->IntersectsBox(x0, x1, y0, y1, z0, z1, in IntersectsBox()
279 int vtkBSPIntersections::IntersectsBox(int *ids, int len, double *x) in IntersectsBox() function in vtkBSPIntersections
281 return this->IntersectsBox(ids, len, x[0], x[1], x[2], x[3], x[4], x[5]); in IntersectsBox()
285 int vtkBSPIntersections::IntersectsBox(int *ids, int len, in IntersectsBox() function in vtkBSPIntersections
309 result = node->IntersectsBox(x0, x1, y0, y1, z0, z1, in _IntersectsBox()
|
| H A D | vtkKdNode.h | 201 int IntersectsBox(double x1,double x2,double y1,double y2,double z1,double z2,
|
| H A D | vtkKdNode.cxx | 554 int vtkKdNode::IntersectsBox(double x0, double x1, double y0, double y1, in IntersectsBox() function in vtkKdNode
743 if (!this->IntersectsBox(cellBounds[0], cellBounds[1], in IntersectsCell()
|
| H A D | vtkKdTree.cxx | 2096 int nRegions = this->BSPCalculator->IntersectsBox(regionIds, this->NumberOfRegions, box); in SearchNeighborsForDuplicate()
|
| /dports/math/vtk9/VTK-9.1.0/Common/DataModel/ |
| H A D | vtkBSPIntersections.h | 93 int IntersectsBox(int regionId, double* x);
94 int IntersectsBox(int regionId, double x0, double x1, double y0, double y1, double z0, double z1);
103 int IntersectsBox(int* ids, int len, double* x);
104 int IntersectsBox(
|
| H A D | vtkBSPIntersections.cxx | 259 int vtkBSPIntersections::IntersectsBox(int regionId, double* x) in IntersectsBox() function in vtkBSPIntersections
261 return this->IntersectsBox(regionId, x[0], x[1], x[2], x[3], x[4], x[5]); in IntersectsBox()
265 int vtkBSPIntersections::IntersectsBox( in IntersectsBox() function in vtkBSPIntersections
272 return node->IntersectsBox(x0, x1, y0, y1, z0, z1, this->ComputeIntersectionsUsingDataBounds); in IntersectsBox()
276 int vtkBSPIntersections::IntersectsBox(int* ids, int len, double* x) in IntersectsBox() function in vtkBSPIntersections
278 return this->IntersectsBox(ids, len, x[0], x[1], x[2], x[3], x[4], x[5]); in IntersectsBox()
282 int vtkBSPIntersections::IntersectsBox( in IntersectsBox() function in vtkBSPIntersections
303 result = node->IntersectsBox(x0, x1, y0, y1, z0, z1, this->ComputeIntersectionsUsingDataBounds); in _IntersectsBox()
|
| H A D | vtkKdNode.h | 198 int IntersectsBox(
|
| H A D | vtkKdNode.cxx | 576 int vtkKdNode::IntersectsBox( in IntersectsBox() function in vtkKdNode
754 if (!this->IntersectsBox(cellBounds[0], cellBounds[1], cellBounds[2], cellBounds[3], in IntersectsCell()
|
| H A D | vtkKdTree.cxx | 2083 int nRegions = this->BSPCalculator->IntersectsBox(regionIds, this->NumberOfRegions, box); in SearchNeighborsForDuplicate()
|
| /dports/games/dhewm3/dhewm3-1.5.1/neo/idlib/bv/ |
| H A D | Frustum.h | 87 bool IntersectsBox( const idBox &box ) const;
|
| H A D | Box.h | 87 bool IntersectsBox( const idBox &a ) const; // includes touching
|
| H A D | Box.cpp | 377 bool idBox::IntersectsBox( const idBox &a ) const { in IntersectsBox() function in idBox
|
| H A D | Frustum.cpp | 909 bool idFrustum::IntersectsBox( const idBox &box ) const { in IntersectsBox() function in idFrustum
|