------------------------------------------------------------------------------ Begin to traverse the cells based on a scalar value. Returned cells will have scalar values that span the scalar value specified.
| 196 | // Begin to traverse the cells based on a scalar value. Returned cells |
| 197 | // will have scalar values that span the scalar value specified. |
| 198 | void vtkSimpleScalarTree::InitTraversal(double scalarValue) |
| 199 | { |
| 200 | this->BuildTree(); |
| 201 | vtkScalarRange<double>* TTree = static_cast<vtkScalarRange<double>*>(this->Tree); |
| 202 | |
| 203 | this->ScalarValue = scalarValue; |
| 204 | this->TreeIndex = this->TreeSize; |
| 205 | |
| 206 | // Check root of tree for overlap with scalar value |
| 207 | // |
| 208 | if (TTree[0].min > scalarValue || TTree[0].max < scalarValue) |
| 209 | { |
| 210 | return; |
| 211 | } |
| 212 | |
| 213 | else // find leaf that overlaps the isocontour value |
| 214 | { |
| 215 | this->FindStartLeaf(0, 0); // recursive function call |
| 216 | } |
| 217 | } |
| 218 | |
| 219 | //------------------------------------------------------------------------------ |
| 220 | int vtkSimpleScalarTree::FindStartLeaf(vtkIdType index, int level) |
nothing calls this directly
no test coverage detected