VTK
|
organize data according to scalar values (used to accelerate contouring operations) More...
#include <vtkScalarTree.h>
Public Types | |
typedef vtkObject | Superclass |
Public Member Functions | |
virtual int | IsA (const char *type) |
vtkScalarTree * | NewInstance () const |
void | PrintSelf (ostream &os, vtkIndent indent) |
virtual void | BuildTree ()=0 |
virtual void | Initialize ()=0 |
virtual void | InitTraversal (double scalarValue)=0 |
virtual void | SetDataSet (vtkDataSet *) |
virtual vtkDataSet * | GetDataSet () |
virtual vtkCell * | GetNextCell (vtkIdType &cellId, vtkIdList *&ptIds, vtkDataArray *cellScalars)=0 |
Static Public Member Functions | |
static int | IsTypeOf (const char *type) |
static vtkScalarTree * | SafeDownCast (vtkObjectBase *o) |
Protected Member Functions | |
virtual vtkObjectBase * | NewInstanceInternal () const |
vtkScalarTree () | |
~vtkScalarTree () | |
Protected Attributes | |
vtkDataSet * | DataSet |
vtkDataArray * | Scalars |
vtkTimeStamp | BuildTime |
double | ScalarValue |
organize data according to scalar values (used to accelerate contouring operations)
vtkScalarTree is an abstract class that defines the API to concrete scalar tree subclasses. A scalar tree is a data structure that organizes data according to its scalar value. This allows rapid access to data for those algorithms that access the data based on scalar value. For example, isocontouring operates on cells based on the scalar (isocontour) value.
To use subclasses of this class, you must specify a dataset to operate on, and then specify a scalar value in the InitTraversal() method. Then calls to GetNextCell() return cells whose scalar data contains the scalar value specified.
Definition at line 46 of file vtkScalarTree.h.
typedef vtkObject vtkScalarTree::Superclass |
Definition at line 49 of file vtkScalarTree.h.
|
protected |
|
protected |
|
static |
|
virtual |
Reimplemented in vtkSimpleScalarTree.
|
static |
|
protectedvirtual |
Reimplemented in vtkSimpleScalarTree.
vtkScalarTree* vtkScalarTree::NewInstance | ( | ) | const |
void vtkScalarTree::PrintSelf | ( | ostream & | os, |
vtkIndent | indent | ||
) |
|
virtual |
Build the tree from the points/cells defining this dataset.
|
virtual |
Build the tree from the points/cells defining this dataset.
|
pure virtual |
Construct the scalar tree from the dataset provided. Checks build times and modified time from input and reconstructs the tree if necessary.
Implemented in vtkSimpleScalarTree.
|
pure virtual |
Initialize locator. Frees memory and resets object as appropriate.
Implemented in vtkSimpleScalarTree.
|
pure virtual |
Begin to traverse the cells based on a scalar value. Returned cells will have scalar values that span the scalar value specified.
Implemented in vtkSimpleScalarTree.
|
pure virtual |
Return the next cell that may contain scalar value specified to initialize traversal. The value NULL is returned if the list is exhausted. Make sure that InitTraversal() has been invoked first or you'll get erratic behavior.
Implemented in vtkSimpleScalarTree.
|
protected |
Definition at line 83 of file vtkScalarTree.h.
|
protected |
Definition at line 84 of file vtkScalarTree.h.
|
protected |
Definition at line 86 of file vtkScalarTree.h.
|
protected |
Definition at line 87 of file vtkScalarTree.h.