40#ifndef vtkHyperTreeGridPlaneCutter_h
41#define vtkHyperTreeGridPlaneCutter_h
43#include "vtkFiltersHyperTreeModule.h"
65 void SetPlane(
double a,
double b,
double c,
double d);
66 vtkGetVector4Macro(Plane,
double);
74 vtkGetMacro(AxisAlignment,
int);
90 vtkSetMacro(Dual,
int);
91 vtkGetMacro(Dual,
int);
92 vtkBooleanMacro(Dual,
int);
141 void PlaneCut(
int,
int,
double[8][3],
int&,
double[][3]);
dynamic, self-adjusting array of bits
object to represent cell connectivity
Cut vtkDataSet with user-specified implicit function.
general representation of visualization data
Superclass for algorithms that produce a hyper tree grid as output.
Objects for traversal a HyperTreeGrid.
Objects for traversal a HyperTreeGrid.
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.
vtkHyperTreeGridPlaneCutter()
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.
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.
static vtkHyperTreeGridPlaneCutter * New()
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 wether 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.
vtkBitArray * InMask
material Mask
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
a simple class to control print indentation
represent and manipulate 3D points