#include "vtkCommonDataModelModule.h"
#include "vtkObject.h"

Include dependency graph for vtkGenericAdaptorCell.h:

Classes
class	vtkGenericAdaptorCell
	defines cell interface More...

Typedefs
typedef vtkObject	Superclass

Functions
vtkGenericAdaptorCell vtkObject	FindClosestBoundary (int subId, double pcoords[3], vtkGenericCellIterator *&boundary)=0
	Put into neighbors' the cells (dimension>boundary->GetDimension()) of the dataset that share the boundary boundary' with this cell.
static vtkTypeBool	IsTypeOf (const char *type)
virtual vtkTypeBool	IsA (const char *type)
static vtkGenericAdaptorCell *	SafeDownCast (vtkObjectBase *o)
virtual vtkObjectBase *	NewInstanceInternal () const
vtkGenericAdaptorCell *	NewInstance () const
void	PrintSelf (ostream &os, vtkIndent indent) override
virtual vtkIdType	GetId ()=0
	Unique identification number of the cell over the whole data set.
virtual int	GetType ()=0
	Does `this' a cell of a dataset?
virtual int	GetDimension ()=0
	Return the topological dimension of the current cell.
virtual int	GetGeometryOrder ()=0
	Return the interpolation order of the geometry.
int	IsGeometryLinear ()
	Does the cell have a non-linear interpolation for the geometry?
virtual int	IsPrimary ()=0
	Return the interpolation order of attribute `a' on the cell (may differ by cell).
virtual int	GetNumberOfPoints ()=0
	Return the number of corner points that compose the cell.
virtual int	GetNumberOfDOFNodes ()=0
	Return the number of boundaries of dimension `dim' (or all dimensions greater than 0 and less than GetDimension() if -1) of the cell.
virtual vtkGenericCellIterator *	NewCellIterator ()=0
	Return the points of cell into `it'.
virtual void	GetBoundaryIterator (vtkGenericCellIterator *boundaries, int dim=-1)=0
	Return the boundaries' cells of dimension dim' (or all dimensions less than GetDimension() if -1) that are part of the boundary of the cell.
virtual int	EvaluatePosition (const double x[3], double *closestPoint, int &subId, double pcoords[3], double &dist2)=0
	Is x' inside the current cell?
virtual void	Clip (double value, vtkImplicitFunction f, vtkGenericAttributeCollection attributes, vtkGenericCellTessellator tess, int insideOut, vtkIncrementalPointLocator locator, vtkCellArray connectivity, vtkPointData outPd, vtkCellData outCd, vtkPointData internalPd, vtkPointData secondaryPd, vtkCellData secondaryCd)
	Determine the global coordinates x' from sub-cell subId' and parametric coordinates `pcoords' in the cell.
virtual void	Derivatives (int subId, double pcoords[3], vtkGenericAttribute attribute, double derivs)=0
	Is there an intersection between the current cell and the ray (p1',p2') according to a tolerance tol'?
virtual double *	GetBounds ()
	Compute the bounding box of the current cell in `bounds' in global coordinates.
virtual double	GetLength2 ()
	Return the bounding box diagonal squared of the current cell.
virtual double *	GetParametricCoords ()=0
	Get the center of the current cell (in parametric coordinates) and place it in `pcoords'.
virtual void	Tessellate (vtkGenericAttributeCollection attributes, vtkGenericCellTessellator tess, vtkPoints points, vtkIncrementalPointLocator locator, vtkCellArray cellArray, vtkPointData internalPd, vtkPointData pd, vtkCellData cd, vtkUnsignedCharArray *types)
	Tessellate the cell if it is not linear or if at least one attribute of attributes' is not linear.
virtual int	IsOnBoundary ()=0
	Is the face `faceId' of the current cell on the exterior boundary of the dataset?
void	Reset ()
	Put into `id' the list of the dataset points that define the corner points of the cell.
void	AllocateTuples (int size)
	Allocate some memory if Tuples does not exist or is smaller than size.

Variables
vtkTetra *	Tetra
vtkTriangle *	Triangle
vtkLine *	Line
vtkVertex *	Vertex
vtkQuad *	Quad
vtkHexahedron *	Hexa
vtkWedge *	Wedge
vtkPyramid *	Pyramid
vtkDoubleArray *	InternalPoints
vtkCellArray *	InternalCellArray
vtkDoubleArray *	InternalScalars
vtkDoubleArray *	PointDataScalars
vtkIdList *	InternalIds
vtkDoubleArray *	Scalars
vtkPointData *	PointData
vtkCellData *	CellData
double *	Tuples
int	TuplesCapacity
double	Bounds [6]

Typedef Documentation

◆ Superclass

typedef vtkObject Superclass

Definition at line 1 of file vtkGenericAdaptorCell.h.

Function Documentation

◆ FindClosestBoundary()

vtkGenericAdaptorCell vtkObject FindClosestBoundary	(	int	subId,
		double	pcoords[3],
		vtkGenericCellIterator *&	boundary )

pure virtual

Put into neighbors' the cells (dimension>boundary->GetDimension()) of the dataset that share the boundary boundary' with this cell.

`this' IS NOT INCLUDED.

Precondition: boundary_exists: boundary!=0; real_boundary: !boundary->IsInDataSet(); cell_of_the_dataset: IsInDataSet(); boundary: HasBoundary(boundary); neighbors_exist: neighbors!=0 */ virtual void GetNeighbors(vtkGenericAdaptorCell* boundary, vtkGenericCellIterator* neighbors) = 0;

/** Compute the closest boundary of the current sub-cell subId' for point pcoord' (in parametric coordinates) in boundary', and return whether the point is inside the cell or not. boundary' is of dimension GetDimension()-1.

Precondition: positive_subId: subId>=0

◆ IsTypeOf()

vtkTypeBool FindClosestBoundary::IsTypeOf ( const char * type )

static

◆ IsA()

virtual vtkTypeBool FindClosestBoundary::IsA ( const char * type )

virtual

◆ SafeDownCast()

vtkGenericAdaptorCell * FindClosestBoundary::SafeDownCast ( vtkObjectBase * o )

static

◆ NewInstanceInternal()

virtual vtkObjectBase * FindClosestBoundary::NewInstanceInternal ( ) const

protectedvirtual

◆ NewInstance()

vtkGenericAdaptorCell * FindClosestBoundary::NewInstance ( ) const

◆ PrintSelf()

void FindClosestBoundary::PrintSelf	(	ostream &	os,
		vtkIndent	indent )

override

◆ GetId()

virtual vtkIdType FindClosestBoundary::GetId ( )

pure virtual

Unique identification number of the cell over the whole data set.

This unique key may not be contiguous.

◆ GetType()

virtual int FindClosestBoundary::GetType ( )

pure virtual

Does `this' a cell of a dataset?

(otherwise, it is a boundary cell) */ virtual int IsInDataSet() = 0;

/** Return the type of the current cell.

Postcondition: (result==VTK_HIGHER_ORDER_EDGE)|| (result==VTK_HIGHER_ORDER_TRIANGLE)|| (result==VTK_HIGHER_ORDER_TETRAHEDRON)

◆ GetDimension()

virtual int FindClosestBoundary::GetDimension ( )

pure virtual

Return the topological dimension of the current cell.

Postcondition: valid_result: result>=0 && result<=3

◆ GetGeometryOrder()

virtual int FindClosestBoundary::GetGeometryOrder ( )

pure virtual

Return the interpolation order of the geometry.

Postcondition: positive_result: result>=0

◆ IsGeometryLinear()

int FindClosestBoundary::IsGeometryLinear ( )

Does the cell have a non-linear interpolation for the geometry?

Postcondition: definition: result==(GetGeometryOrder()==1)

◆ IsPrimary()

virtual int FindClosestBoundary::IsPrimary ( )

pure virtual

Return the interpolation order of attribute `a' on the cell (may differ by cell).

Precondition: a_exists: a!=0

Postcondition: positive_result: result>=0 */ virtual int GetAttributeOrder(vtkGenericAttribute* a) = 0;

/** Return the index of the first point centered attribute with the highest order in `ac'.

Precondition: ac_exists: ac!=0

Postcondition: valid_result: result>=-1 && result<ac->GetNumberOfAttributes() */ virtual int GetHighestOrderAttribute(vtkGenericAttributeCollection* ac);

/** Does the attribute `a' have a non-linear interpolation?

Precondition: a_exists: a!=0

Postcondition: definition: result==(GetAttributeOrder()==1) */ vtkTypeBool IsAttributeLinear(vtkGenericAttribute* a);

/** Is the cell primary (i.e. not composite) ?

◆ GetNumberOfPoints()

virtual int FindClosestBoundary::GetNumberOfPoints ( )

pure virtual

Return the number of corner points that compose the cell.

Postcondition: positive_result: result>=0

◆ GetNumberOfDOFNodes()

virtual int FindClosestBoundary::GetNumberOfDOFNodes ( )

pure virtual

Return the number of boundaries of dimension `dim' (or all dimensions greater than 0 and less than GetDimension() if -1) of the cell.

When dim is -1, the number of vertices is not included in the count because vertices are a special case: a vertex will have at most a single field value associated with it; DOF nodes may have an arbitrary number of field values associated with them.

Precondition: valid_dim_range: (dim==-1) || ((dim>=0)&&(dim<GetDimension()))

Postcondition: positive_result: result>=0 */ virtual int GetNumberOfBoundaries(int dim = -1) = 0;

/** Accumulated number of DOF nodes of the current cell. A DOF node is a component of cell with a given topological dimension. e.g.: a triangle has 4 DOF: 1 face and 3 edges. An hexahedron has 19 DOF: 1 region, 6 faces, and 12 edges.

The number of vertices is not included in the count because vertices are a special case: a vertex will have at most a single field value associated with it; DOF nodes may have an arbitrary number of field values associated with them.

Postcondition: valid_result: result==GetNumberOfBoundaries(-1)+1

◆ NewCellIterator()

virtual vtkGenericCellIterator * FindClosestBoundary::NewCellIterator ( )

pure virtual

Return the points of cell into `it'.

Precondition: it_exists: it!=0 */ virtual void GetPointIterator(vtkGenericPointIterator* it) = 0;

/** Create an empty cell iterator. The user is responsible for deleting it.

Postcondition: result_exists: result!=0

◆ GetBoundaryIterator()

virtual void FindClosestBoundary::GetBoundaryIterator	(	vtkGenericCellIterator *	boundaries,
		int	dim = -1 )

pure virtual

Return the boundaries' cells of dimension dim' (or all dimensions less than GetDimension() if -1) that are part of the boundary of the cell.

Precondition: valid_dim_range: (dim==-1) || ((dim>=0)&&(dim<GetDimension())); boundaries_exist: boundaries!=0

◆ EvaluatePosition()

virtual int EvaluatePosition	(	const double	x[3],
		double *	closestPoint,
		int &	subId,
		double	pcoords[3],
		double &	dist2 )

pure virtual

Is x' inside the current cell?

It also evaluates parametric coordinates pcoords', sub-cell id subId' (0 means primary cell), distance squared to the sub-cell in dist2' and closest corner point closestPoint'. dist2' and closestPoint' are not evaluated if closestPoint'==0. If a numerical error occurred, -1 is returned and all other results should be ignored.

Postcondition: valid_result: result==-1 || result==0 || result==1; positive_distance: result!=-1 implies (closestPoint!=0 implies dist2>=0)

◆ Clip()

virtual void Clip	(	double	value,
		vtkImplicitFunction *	f,
		vtkGenericAttributeCollection *	attributes,
		vtkGenericCellTessellator *	tess,
		int	insideOut,
		vtkIncrementalPointLocator *	locator,
		vtkCellArray *	connectivity,
		vtkPointData *	outPd,
		vtkCellData *	outCd,
		vtkPointData *	internalPd,
		vtkPointData *	secondaryPd,
		vtkCellData *	secondaryCd )

virtual

Determine the global coordinates x' from sub-cell subId' and parametric coordinates `pcoords' in the cell.

Precondition: positive_subId: subId>=0; clamped_pcoords: (0<=pcoords[0])&&(pcoords[0]<=1)&&(0<=pcoords[1]) &&(pcoords[1]<=1)&&(0<=pcoords[2])&&(pcoords[2]<=1) */ virtual void EvaluateLocation(int subId, double pcoords[3], double x[3]) = 0;

/** Interpolate the attribute a' at local position pcoords' of the cell into `val'.

Precondition: a_exists: a!=0; a_is_point_centered: a->GetCentering()==vtkPointCentered; clamped_point: pcoords[0]>=0 && pcoords[0]<=1 && pcoords[1]>=0 && pcoords[1]<=1 && pcoords[2]>=0 && pcoords[2]<=1; val_exists: val!=0; valid_size: sizeof(val)==a->GetNumberOfComponents() */ virtual void InterpolateTuple(vtkGenericAttribute* a, double pcoords[3], double* val) = 0;

/** Interpolate the whole collection of attributes c' at local position pcoords' of the cell into `val'. Only point centered attributes are taken into account.

Precondition: c_exists: c!=0; clamped_point: pcoords[0]>=0 && pcoords[0]<=1 && pcoords[1]>=0 && pcoords[1]<=1 && pcoords[2]>=0 && pcoords[2]<=1; val_exists: val!=0; valid_size: sizeof(val)==c->GetNumberOfPointCenteredComponents() */ virtual void InterpolateTuple( vtkGenericAttributeCollection* c, double pcoords[3], double* val) = 0;

/** Generate a contour (contouring primitives) for each values' or with respect to an implicit function f'. Contouring is performed on the scalar attribute (attributes->GetActiveAttribute()' attributes->GetActiveComponent()'). Contouring interpolates the attributes->GetNumberOfattributesToInterpolate()' attributes attributes->GetAttributesToInterpolate()'. The locator', verts', lines', polys', outPd' and outCd' are cumulative data arrays over cell iterations: they store the result of each call to Contour():

locator' is a points list that merges points as they are inserted (i.e., prevents duplicates).
verts' is an array of generated vertices
lines' is an array of generated lines
polys' is an array of generated polygons
outPd' is an array of interpolated point data along the edge (if not-nullptr)
outCd' is an array of copied cell data of the current cell (if not-nullptr) internalPd', secondaryPd' and secondaryCd' are initialized by the filter that call it from attributes'.
internalPd' stores the result of the tessellation pass: the higher-order cell is tessellated into linear sub-cells.
secondaryPd' and secondaryCd' are used internally as inputs to the Contour() method on linear sub-cells. Note: the CopyAllocate() method must be invoked on both outPd' and outCd', from secondaryPd' and `secondaryCd'.

NOTE: vtkGenericAttributeCollection *attributes' will be replaced by a vtkInformation'.

Precondition: values_exist: (values!=0 && f==0) || (values==0 && f!=0); attributes_exist: attributes!=0; tessellator_exists: tess!=0; locator_exists: locator!=0; verts_exist: verts!=0; lines_exist: lines!=0; polys_exist: polys!=0; internalPd_exists: internalPd!=0; secondaryPd_exists: secondaryPd!=0; secondaryCd_exists: secondaryCd!=0 */ virtual void Contour(vtkContourValues* values, vtkImplicitFunction* f, vtkGenericAttributeCollection* attributes, vtkGenericCellTessellator* tess, vtkIncrementalPointLocator* locator, vtkCellArray* verts, vtkCellArray* lines, vtkCellArray* polys, vtkPointData* outPd, vtkCellData* outCd, vtkPointData* internalPd, vtkPointData* secondaryPd, vtkCellData* secondaryCd);

/** Cut (or clip) the current cell with respect to the contour defined by the value' or the implicit function f' of the scalar attribute (attributes->GetActiveAttribute()',attributes->GetActiveComponent()'). If f' exists, value' is not used. The output is the part of the current cell which is inside the contour. The output is a set of zero, one or more cells of the same topological dimension as the current cell. Normally, cell points whose scalar value is greater than "value" are considered inside. If insideOut' is on, this is reversed. Clipping interpolates the attributes->GetNumberOfattributesToInterpolate()' attributes attributes->GetAttributesToInterpolate()'. locator', connectivity', outPd' and outCd' are cumulative data arrays over cell iterations: they store the result of each call to Clip():

locator' is a points list that merges points as they are inserted (i.e., prevents duplicates).

connectivity' is an array of generated cells
outPd' is an array of interpolated point data along the edge (if not-nullptr)
outCd' is an array of copied cell data of the current cell (if not-nullptr) internalPd', secondaryPd' and secondaryCd' are initialized by the filter that call it from attributes'.
internalPd' stores the result of the tessellation pass: the higher-order cell is tessellated into linear sub-cells.
secondaryPd' and secondaryCd' are used internally as inputs to the Clip() method on linear sub-cells. Note: the CopyAllocate() method must be invoked on both outPd' and outCd', from secondaryPd' and secondaryCd'.

NOTE: vtkGenericAttributeCollection *attributes' will be replaced by a vtkInformation'.

Precondition: attributes_exist: attributes!=0; tessellator_exists: tess!=0; locator_exists: locator!=0; connectivity_exists: connectivity!=0; internalPd_exists: internalPd!=0; secondaryPd_exists: secondaryPd!=0; secondaryCd_exists: secondaryCd!=0

◆ Derivatives()

virtual void Derivatives	(	int	subId,
		double	pcoords[3],
		vtkGenericAttribute *	attribute,
		double *	derivs )

pure virtual

Is there an intersection between the current cell and the ray (p1',p2') according to a tolerance tol'?

If true, x' is the global intersection, t' is the parametric coordinate for the line, pcoords' are the parametric coordinates for cell. `subId' is the sub-cell where the intersection occurs.

Precondition: positive_tolerance: tol>0 */ virtual int IntersectWithLine(double p1[3], double p2[3], double tol, double& t, double x[3], double pcoords[3], int& subId) = 0;

/** Compute derivatives derivs' of the attribute attribute' (from its values at the corner points of the cell) given sub-cell subId' (0 means primary cell) and parametric coordinates pcoords'. Derivatives are in the x-y-z coordinate directions for each data value.

Precondition: positive_subId: subId>=0; clamped_pcoords: (0<=pcoords[0])&&(pcoords[0]<=1)&&(0<=pcoords[1]) &&(pcoords[1]<=1)&&(0<=pcoords[2])%%(pcoords[2]<=1); attribute_exists: attribute!=0; derivs_exists: derivs!=0; valid_size: sizeof(derivs)>=attribute->GetNumberOfComponents()*3

◆ GetBounds()

virtual double * GetBounds ( )

virtual

Compute the bounding box of the current cell in `bounds' in global coordinates.

THREAD SAFE */ virtual void GetBounds(double bounds[6]) = 0;

/** Return the bounding box of the current cell in global coordinates. NOT THREAD SAFE

Postcondition: result_exists: result!=0; valid_size: sizeof(result)>=6

◆ GetLength2()

virtual double GetLength2 ( )

virtual

Return the bounding box diagonal squared of the current cell.

Postcondition: positive_result: result>=0

◆ GetParametricCoords()

virtual double * GetParametricCoords ( )

pure virtual

Get the center of the current cell (in parametric coordinates) and place it in `pcoords'.

If the current cell is a composite, the return value is the sub-cell id that the center is in.

Postcondition: valid_result: (result>=0) && (IsPrimary() implies result==0) */ virtual int GetParametricCenter(double pcoords[3]) = 0;

/** Return the distance of the parametric coordinate `pcoords' to the current cell. If inside the cell, a distance of zero is returned. This is used during picking to get the correct cell picked. (The tolerance will occasionally allow cells to be picked who are not really intersected "inside" the cell.)

Postcondition: positive_result: result>=0 */ virtual double GetParametricDistance(const double pcoords[3]) = 0;

/** Return a contiguous array of parametric coordinates of the corrner points defining the current cell. In other words, (px,py,pz, px,py,pz, etc..) The coordinates are ordered consistent with the definition of the point ordering for the cell. Note that 3D parametric coordinates are returned no matter what the topological dimension of the cell.

Postcondition: valid_result_exists: ((IsPrimary()) && (result!=0)) || ((!IsPrimary()) && (result==0)) result!=0 implies sizeof(result)==GetNumberOfPoints()

◆ Tessellate()

virtual void Tessellate	(	vtkGenericAttributeCollection *	attributes,
		vtkGenericCellTessellator *	tess,
		vtkPoints *	points,
		vtkIncrementalPointLocator *	locator,
		vtkCellArray *	cellArray,
		vtkPointData *	internalPd,
		vtkPointData *	pd,
		vtkCellData *	cd,
		vtkUnsignedCharArray *	types )

virtual

Tessellate the cell if it is not linear or if at least one attribute of attributes' is not linear.

The output are linear cells of the same dimension than the cell. If the cell is linear and all attributes are linear, the output is just a copy of the current cell. points', cellArray', pd' and cd' are cumulative output data arrays over cell iterations: they store the result of each call to Tessellate(). internalPd' is initialized by the calling filter and stores the result of the tessellation. If it is not null, types' is filled with the types of the linear cells. types' is null when it is called from vtkGenericGeometryFilter and not null when it is called from vtkGenericDatasetTessellator.

Precondition: attributes_exist: attributes!=0; tessellator_exists: tess!=0; points_exist: points!=0; cellArray_exists: cellArray!=0; internalPd_exists: internalPd!=0; pd_exist: pd!=0; cd_exists: cd!=0

◆ IsOnBoundary()

virtual int IsOnBoundary ( )

pure virtual

Is the face `faceId' of the current cell on the exterior boundary of the dataset?

Precondition: 3d: GetDimension()==3 */ virtual int IsFaceOnBoundary(vtkIdType faceId) = 0;

/** Is the cell on the exterior boundary of the dataset?

Precondition: 2d: GetDimension()==2

◆ Reset()

void Reset ( )

Put into `id' the list of the dataset points that define the corner points of the cell.

Precondition: id_exists: id!=0; valid_size: sizeof(id)==GetNumberOfPoints(); */ virtual void GetPointIds(vtkIdType* id) = 0;

/** Tessellate face `index' of the cell. See Tessellate() for further explanations.

Precondition: cell_is_3d: GetDimension()==3; attributes_exist: attributes!=0; tessellator_exists: tess!=0; valid_face: index>=0; points_exist: points!=0; cellArray_exists: cellArray!=0; internalPd_exists: internalPd!=0; pd_exist: pd!=0; cd_exists: cd!=0 */ virtual void TriangulateFace(vtkGenericAttributeCollection* attributes, vtkGenericCellTessellator* tess, int index, vtkPoints* points, vtkIncrementalPointLocator* locator, vtkCellArray* cellArray, vtkPointData* internalPd, vtkPointData* pd, vtkCellData* cd);

/** Return the ids of the vertices defining face `faceId'. Ids are related to the cell, not to the dataset.

Precondition: is_3d: this->GetDimension()==3; valid_faceId_range: faceId>=0 && faceId<this->GetNumberOfBoundaries(2)

Postcondition: result_exists: result!=0; valid_size: sizeof(result)>=GetNumberOfVerticesOnFace(faceId)

Note: The return type changed. It used to be int*, it is now const vtkIdType*. This is so ids are unified between vtkCell and vtkPoints, and so vtkCell ids can be used as inputs in algorithms such as vtkPolygon::ComputeNormal. */ virtual const vtkIdType* GetFaceArray(vtkIdType faceId) = 0;

/** Return the number of vertices defining face `faceId'.

Precondition: is_3d: this->GetDimension()==3; valid_faceId_range: faceId>=0 && faceId<this->GetNumberOfBoundaries(2)

Postcondition: positive_result: && result>0 */ virtual int GetNumberOfVerticesOnFace(int faceId) = 0;

/** Return the ids of the vertices defining edge `edgeId'. Ids are related to the cell, not to the dataset.

Precondition: valid_dimension: this->GetDimension()>=2; valid_edgeId_range: edgeId>=0 && edgeId<this->GetNumberOfBoundaries(1)

Postcondition: result_exists: result!=0; valid_size: sizeof(result)==2

Note: The return type changed. It used to be int*, it is now const vtkIdType*. This is so ids are unified between vtkCell and vtkPoints. */ virtual const vtkIdType* GetEdgeArray(vtkIdType edgeId) = 0;

protected: vtkGenericAdaptorCell(); ~vtkGenericAdaptorCell() override;

/** Reset internal structures.

◆ AllocateTuples()

void AllocateTuples ( int size )

Allocate some memory if Tuples does not exist or is smaller than size.

Precondition: positive_size: size>0

Variable Documentation

◆ Tetra

vtkTetra* Tetra

Definition at line 578 of file vtkGenericAdaptorCell.h.

◆ Triangle

vtkTriangle* Triangle

Definition at line 579 of file vtkGenericAdaptorCell.h.

◆ Line

vtkLine* Line

Definition at line 580 of file vtkGenericAdaptorCell.h.

◆ Vertex

vtkVertex* Vertex

Definition at line 581 of file vtkGenericAdaptorCell.h.

◆ Quad

vtkQuad* Quad

Definition at line 582 of file vtkGenericAdaptorCell.h.

◆ Hexa

vtkHexahedron* Hexa

Definition at line 583 of file vtkGenericAdaptorCell.h.

◆ Wedge

vtkWedge* Wedge

Definition at line 584 of file vtkGenericAdaptorCell.h.

◆ Pyramid

vtkPyramid* Pyramid

Definition at line 585 of file vtkGenericAdaptorCell.h.

◆ InternalPoints

vtkDoubleArray* InternalPoints

Definition at line 592 of file vtkGenericAdaptorCell.h.

◆ InternalCellArray

vtkCellArray* InternalCellArray

Definition at line 593 of file vtkGenericAdaptorCell.h.

◆ InternalScalars

vtkDoubleArray* InternalScalars

Definition at line 594 of file vtkGenericAdaptorCell.h.

◆ PointDataScalars

vtkDoubleArray* PointDataScalars

Definition at line 595 of file vtkGenericAdaptorCell.h.

◆ InternalIds

vtkIdList* InternalIds

Definition at line 597 of file vtkGenericAdaptorCell.h.

◆ Scalars

vtkDoubleArray* Scalars

Definition at line 600 of file vtkGenericAdaptorCell.h.

◆ PointData

vtkPointData* PointData

Definition at line 601 of file vtkGenericAdaptorCell.h.

◆ CellData

vtkCellData* CellData

Definition at line 602 of file vtkGenericAdaptorCell.h.

◆ Tuples

double* Tuples

Definition at line 606 of file vtkGenericAdaptorCell.h.

◆ TuplesCapacity

int TuplesCapacity

Definition at line 607 of file vtkGenericAdaptorCell.h.

◆ Bounds

double Bounds[6]

Definition at line 610 of file vtkGenericAdaptorCell.h.

Classes

Typedefs

Functions

Variables

Typedef Documentation

◆ Superclass

Function Documentation

◆ FindClosestBoundary()

◆ IsTypeOf()

◆ IsA()

◆ SafeDownCast()

◆ NewInstanceInternal()

◆ NewInstance()

◆ PrintSelf()

◆ GetId()

◆ GetType()

◆ GetDimension()

◆ GetGeometryOrder()

◆ IsGeometryLinear()

◆ IsPrimary()

◆ GetNumberOfPoints()

◆ GetNumberOfDOFNodes()

◆ NewCellIterator()

◆ GetBoundaryIterator()

◆ EvaluatePosition()

◆ Clip()

◆ Derivatives()

◆ GetBounds()

◆ GetLength2()

◆ GetParametricCoords()

◆ Tessellate()

◆ IsOnBoundary()

◆ Reset()

◆ AllocateTuples()

Variable Documentation

◆ Tetra

◆ Triangle

◆ Line

◆ Vertex

◆ Quad

◆ Hexa

◆ Wedge

◆ Pyramid

◆ InternalPoints

◆ InternalCellArray

◆ InternalScalars

◆ PointDataScalars

◆ InternalIds

◆ Scalars

◆ PointData

◆ CellData

◆ Tuples

◆ TuplesCapacity

◆ Bounds