 |
VTK
9.0.1
|
Go to the documentation of this file.
23 #ifndef vtkHyperTreeGridToDualGrid_h
24 #define vtkHyperTreeGridToDualGrid_h
26 #include "vtkFiltersHyperTreeModule.h"
62 void TraverseDualRecursively(
64 void GenerateDualCornerFromLeaf1D(
66 void GenerateDualCornerFromLeaf2D(
68 void GenerateDualCornerFromLeaf3D(
71 void TraverseDualRecursively(
73 void ShiftDualCornerFromMaskedLeaf2D(
75 void ShiftDualCornerFromMaskedLeaf3D(
77 void GenerateDualCornerFromLeaf2D(
79 void GenerateDualCornerFromLeaf3D(
84 std::map<vtkIdType, bool> PointShifted;
85 std::map<vtkIdType, double> PointShifts[3];
86 std::map<vtkIdType, double> ReductionFactors;
represent and manipulate 3D points
Objects for traversal a HyperTreeGrid.
virtual int ProcessTrees(vtkHyperTreeGrid *, vtkDataObject *)=0
Main routine to process individual trees in the grid This is pure virtual method to be implemented by...
void PrintSelf(ostream &os, vtkIndent indent) override
Methods invoked by print to print information about the object including superclasses.
a simple class to control print indentation
static vtkAlgorithm * New()
int FillOutputPortInformation(int, vtkInformation *) override
Fill the output port information objects for this algorithm.
dynamic, self-adjusting array of vtkIdType
Convert hyper tree grid to the dual unstructured grid.
dynamic, self-adjusting array of bits
dataset represents arbitrary combinations of all possible cell types
general representation of visualization data
Superclass for algorithms that produce a hyper tree grid as output.
A dataset containing a grid of vtkHyperTree instances arranged as a rectilinear grid.