VTK
vtkHyperTreeGridGeometry.h
Go to the documentation of this file.
1 /*=========================================================================
2 
3  Program: Visualization Toolkit
4  Module: vtkHyperTreeGridGeometry.h
5 
6  Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
7  All rights reserved.
8  See Copyright.txt or http://www.kitware.com/Copyright.htm for details.
9 
10  This software is distributed WITHOUT ANY WARRANTY; without even
11  the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
12  PURPOSE. See the above copyright notice for more information.
13 
14 =========================================================================*/
33 #ifndef vtkHyperTreeGridGeometry_h
34 #define vtkHyperTreeGridGeometry_h
35 
36 #include "vtkFiltersHyperTreeModule.h" // For export macro
38 
39 class vtkBitArray;
40 class vtkCellArray;
41 class vtkDoubleArray;
42 class vtkHyperTreeGrid;
44 class vtkIdList;
45 class vtkIdTypeArray;
46 class vtkPoints;
47 
48 class VTKFILTERSHYPERTREE_EXPORT vtkHyperTreeGridGeometry : public vtkHyperTreeGridAlgorithm
49 {
50 public:
51  static vtkHyperTreeGridGeometry* New();
53  void PrintSelf( ostream&, vtkIndent ) override;
54 
55 protected:
57  ~vtkHyperTreeGridGeometry() override;
58 
62  int FillOutputPortInformation( int, vtkInformation* ) override;
63 
67  int ProcessTrees( vtkHyperTreeGrid*, vtkDataObject* ) override;
68 
72  void RecursivelyProcessTree( vtkHyperTreeGridCursor*, vtkBitArray* );
73 
77  void ProcessLeaf1D( vtkHyperTreeGridCursor* );
78 
82  void ProcessLeaf2D( vtkHyperTreeGridCursor*, vtkBitArray* );
83 
87  void ProcessLeaf3D( vtkHyperTreeGridCursor*, vtkBitArray* );
88 
92  void AddFace( vtkIdType, double*, double*, int, unsigned int, bool create = true );
93 
97  unsigned int Dimension;
98 
102  unsigned int Orientation;
103 
108 
113 
115 
122 
124 
130 
132 
135  vtkIdType EdgesA[12];
136  vtkIdType EdgesB[12];
138 
140 
146 
148 
154 
155 private:
157  void operator=(const vtkHyperTreeGridGeometry&) = delete;
158 };
159 
160 #endif /* vtkHyperTreeGridGeometry_h */
vtkIdTypeArray * FacesB
Storage for interface faces.
int FillOutputPortInformation(int, vtkInformation *) override
Define default input and output port types.
Store vtkAlgorithm input/output information.
A dataset containing a grid of vtkHyperTree instances arranged as a rectilinear grid.
bool HasInterface
Keep track of input interface parameters.
unsigned int Dimension
Dimension of input grid.
vtkIdTypeArray * FacesA
Storage for interface faces.
dynamic, self-adjusting array of vtkIdType
int vtkIdType
Definition: vtkType.h:347
Hyper tree grid outer surface.
dynamic, self-adjusting array of double
vtkDoubleArray * FaceScalarsB
Storage for interface scalars.
Objects for depth-first traversal HyperTreeGrids.
a simple class to control print indentation
Definition: vtkIndent.h:39
void PrintSelf(ostream &os, vtkIndent indent) override
Methods invoked by print to print information about the object including superclasses.
list of point or cell ids
Definition: vtkIdList.h:36
vtkDoubleArray * Normals
Keep track of input interface parameters.
vtkDoubleArray * Intercepts
Keep track of input interface parameters.
object to represent cell connectivity
Definition: vtkCellArray.h:50
dynamic, self-adjusting array of bits
Definition: vtkBitArray.h:36
vtkDoubleArray * FaceScalarsA
Storage for interface scalars.
Superclass for algorithms that produce a hyper tree grid as output.
vtkPoints * Points
Storage for points of output unstructured mesh.
static vtkAlgorithm * New()
unsigned int Orientation
Orientation of input grid when dimension < 3.
vtkCellArray * Cells
Storage for cells of output unstructured mesh.
vtkPoints * FacePoints
Storage for interface points.
general representation of visualization data
Definition: vtkDataObject.h:64
vtkIdList * FaceIDs
Storage for interface points.
represent and manipulate 3D points
Definition: vtkPoints.h:39
virtual int ProcessTrees(vtkHyperTreeGrid *, vtkDataObject *)=0
Main routine to process individual trees in the grid This is pure virtual method to be implemented by...