VTK  9.3.20240328
vtkHyperTreeGridPlaneCutter.h
Go to the documentation of this file.
1 // SPDX-FileCopyrightText: Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
2 // SPDX-License-Identifier: BSD-3-Clause
31 #ifndef vtkHyperTreeGridPlaneCutter_h
32 #define vtkHyperTreeGridPlaneCutter_h
33 
34 #include "vtkFiltersHyperTreeModule.h" // For export macro
36 
37 VTK_ABI_NAMESPACE_BEGIN
38 class vtkCellArray;
39 class vtkCutter;
40 class vtkIdList;
41 class vtkPoints;
44 
45 class VTKFILTERSHYPERTREE_EXPORT vtkHyperTreeGridPlaneCutter : public vtkHyperTreeGridAlgorithm
46 {
47 public:
50  void PrintSelf(ostream& os, vtkIndent indent) override;
51 
53 
57  void SetPlane(double a, double b, double c, double d);
58  vtkGetVector4Macro(Plane, double);
60 
62 
66  vtkGetMacro(AxisAlignment, int);
68 
70 
73  bool IsPlaneOrthogonalToXAxis() { return this->AxisAlignment == 0; }
74  bool IsPlaneOrthogonalToYAxis() { return this->AxisAlignment == 1; }
75  bool IsPlaneOrthogonalToZAxis() { return this->AxisAlignment == 2; }
76  //}@
77 
79 
82  vtkSetMacro(Dual, int);
83  vtkGetMacro(Dual, int);
84  vtkBooleanMacro(Dual, int);
86 
87 protected:
90 
94  virtual void Reset();
95 
100 
105 
110 
115 
120 
124  bool CheckIntersection(double[8][3], double[8]);
125 
126  // Check if a cursor is intersected by a plane.
127  // Don't return function evaluations
128  bool CheckIntersection(double[8][3]);
129 
133  void PlaneCut(int, int, double[8][3], int&, double[][3]);
134 
138  void ReorderCutPoints(int, double[][3]);
139 
143  double Plane[4];
144 
148  int Dual;
149 
154 
159 
164 
169 
174 
179 
184 
189 
190 private:
192  void operator=(const vtkHyperTreeGridPlaneCutter&) = delete;
193 };
194 
195 VTK_ABI_NAMESPACE_END
196 #endif /* vtkHyperTreeGridPlaneCutter_h */
dynamic, self-adjusting array of bits
Definition: vtkBitArray.h:29
object to represent cell connectivity
Definition: vtkCellArray.h:285
Cut vtkDataSet with user-specified implicit function.
Definition: vtkCutter.h:161
general representation of visualization data
Superclass for algorithms that produce a hyper tree grid as output.
cut an hyper tree grid volume with a plane and generate a polygonal cut surface.
vtkCellArray * Cells
Storage for cells of output unstructured mesh.
bool IsPlaneOrthogonalToZAxis()
Returns true if plane's normal is aligned with the corresponding axis, false elsewise.
vtkBitArray * SelectedCells
Storage for pre-selected cells to be processed in dual mode.
virtual void Reset()
Resets every attributes to a minimal state needed for the algorithm to execute.
vtkCutter * Cutter
Cutter to be used on dual cells.
void PrintSelf(ostream &os, vtkIndent indent) override
Methods invoked by print to print information about the object including superclasses.
vtkPoints * Centers
Storage for dual vertices at center of primal cells.
int FillOutputPortInformation(int, vtkInformation *) override
For this algorithm the output is a vtkPolyData instance.
bool RecursivelyPreProcessTree(vtkHyperTreeGridNonOrientedGeometryCursor *)
Recursively decide whether cell is intersected by plane.
bool CheckIntersection(double[8][3])
void RecursivelyProcessTreePrimal(vtkHyperTreeGridNonOrientedGeometryCursor *)
Recursively descend into tree down to leaves, cutting primal cells.
int Dual
Decide whether output mesh should be a computed on dual grid.
vtkPoints * Points
Storage for points of output unstructured mesh.
static vtkHyperTreeGridPlaneCutter * New()
vtkIdList * Leaves
Storage for dual vertex indices.
void SetPlane(double a, double b, double c, double d)
Specify the plane with its [a,b,c,d] Cartesian coefficients: a*x + b*y + c*z = d.
bool CheckIntersection(double[8][3], double[8])
Check if a cursor is intersected by a plane.
bool IsPlaneOrthogonalToXAxis()
Returns true if plane's normal is aligned with the corresponding axis, false elsewise.
int AxisAlignment
Flag computed at plane creation to know whether it is aligned with x, y or z axis.
int ProcessTrees(vtkHyperTreeGrid *, vtkDataObject *) override
Top-level routine to generate plane cut.
~vtkHyperTreeGridPlaneCutter() override
void RecursivelyProcessTreeDual(vtkHyperTreeGridNonOrientedMooreSuperCursor *)
Recursively descend into tree down to leaves, cutting dual cells.
void PlaneCut(int, int, double[8][3], int &, double[][3])
Compute the intersection between an edge and a plane.
bool IsPlaneOrthogonalToYAxis()
Returns true if plane's normal is aligned with the corresponding axis, false elsewise.
void ReorderCutPoints(int, double[][3])
Reorder cut points following the perimeter of the cut.
A dataset containing a grid of vtkHyperTree instances arranged as a rectilinear grid.
list of point or cell ids
Definition: vtkIdList.h:132
a simple class to control print indentation
Definition: vtkIndent.h:108
Store vtkAlgorithm input/output information.
represent and manipulate 3D points
Definition: vtkPoints.h:138