# encoding: utf-8 # module vtkmodules.vtkCommonDataModel # from C:\Users\xukai\Downloads\发票2\venv\Lib\site-packages\vtkmodules\vtkCommonDataModel.cp311-win_amd64.pyd # by generator 1.147 # no doc # imports import vtkmodules.vtkCommonCore as __vtkmodules_vtkCommonCore import vtkmodules.vtkCommonMath as __vtkmodules_vtkCommonMath import vtkmodules.vtkCommonTransforms as __vtkmodules_vtkCommonTransforms from .vtkCell3D import vtkCell3D class vtkWedge(vtkCell3D): """ vtkWedge - a 3D cell that represents a linear wedge Superclass: vtkCell3D vtkWedge is a concrete implementation of vtkCell to represent a linear 3D wedge. A wedge consists of two triangular and three quadrilateral faces and is defined by the six points (0-5). vtkWedge uses the standard isoparametric shape functions for a linear wedge. The wedge is defined by the six points (0-5) where (0,1,2) is the base of the wedge which, using the right hand rule, forms a triangle whose normal points outward (away from the triangular face (3,4,5)). @sa vtkConvexPointSet vtkHexahedron vtkPyramid vtkTetra vtkVoxel """ def CellBoundary(self, subId, pcoords, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ """ CellBoundary(self, subId:int, pcoords:(float, float, float), pts:vtkIdList) -> int C++: int CellBoundary(int subId, const double pcoords[3], vtkIdList *pts) override; Given parametric coordinates of a point, return the closest cell boundary, and whether the point is inside or outside of the cell. The cell boundary is defined by a list of points (pts) that specify a face (3D cell), edge (2D cell), or vertex (1D cell). If the return value of the method is != 0, then the point is inside the cell. """ pass def ComputeCentroid(self, points, pointIds, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ """ ComputeCentroid(points:vtkPoints, pointIds:(int, ...), centroid:[float, float, float]) -> bool C++: static bool ComputeCentroid(vtkPoints *points, const vtkIdType *pointIds, double centroid[3]) Static method version of GetCentroid. """ pass def Contour(self, value, cellScalars, locator, verts, lines, polys, inPd, outPd, inCd, cellId, outCd): # real signature unknown; restored from __doc__ """ Contour(self, value:float, cellScalars:vtkDataArray, locator:vtkIncrementalPointLocator, verts:vtkCellArray, lines:vtkCellArray, polys:vtkCellArray, inPd:vtkPointData, outPd:vtkPointData, inCd:vtkCellData, cellId:int, outCd:vtkCellData) -> None C++: void Contour(double value, vtkDataArray *cellScalars, vtkIncrementalPointLocator *locator, vtkCellArray *verts, vtkCellArray *lines, vtkCellArray *polys, vtkPointData *inPd, vtkPointData *outPd, vtkCellData *inCd, vtkIdType cellId, vtkCellData *outCd) override; Generate contouring primitives. The scalar list cellScalars are scalar values at each cell point. The point locator is essentially a points list that merges points as they are inserted (i.e., prevents duplicates). Contouring primitives can be vertices, lines, or polygons. It is possible to interpolate point data along the edge by providing input and output point data - if outPd is nullptr, then no interpolation is performed. Also, if the output cell data is non-nullptr, the cell data from the contoured cell is passed to the generated contouring primitives. (Note: the CopyAllocate() method must be invoked on both the output cell and point data. The cellId refers to the cell from which the cell data is copied.) """ pass def Derivatives(self, subId, pcoords, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ """ Derivatives(self, subId:int, pcoords:(float, float, float), values:(float, ...), dim:int, derivs:[float, ...]) -> None C++: void Derivatives(int subId, const double pcoords[3], const double *values, int dim, double *derivs) override; Compute derivatives given cell subId and parametric coordinates. The values array is a series of data value(s) at the cell points. There is a one-to-one correspondence between cell point and data value(s). Dim is the number of data values per cell point. Derivs are derivatives in the x-y-z coordinate directions for each data value. Thus, if computing derivatives for a scalar function in a hexahedron, dim=1, 8 values are supplied, and 3 deriv values are returned (i.e., derivatives in x-y-z directions). On the other hand, if computing derivatives of velocity (vx,vy,vz) dim=3, 24 values are supplied ((vx,vy,vz)1, (vx,vy,vz)2, ....()8), and 9 deriv values are returned ((d(vx)/dx),(d(vx)/dy),(d(vx)/dz), (d(vy)/dx),(d(vy)/dy), (d(vy)/dz), (d(vz)/dx),(d(vz)/dy),(d(vz)/dz)). """ pass def EvaluateLocation(self, subId, pcoords, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ """ EvaluateLocation(self, subId:int, pcoords:(float, float, float), x:[float, float, float], weights:[float, ...]) -> None C++: void EvaluateLocation(int &subId, const double pcoords[3], double x[3], double *weights) override; Determine global coordinate (x[3]) from subId and parametric coordinates. Also returns interpolation weights. (The number of weights is equal to the number of points in the cell.) """ pass def EvaluatePosition(self, x, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ """ EvaluatePosition(self, x:(float, float, float), closestPoint:[float, float, float], subId:int, pcoords:[float, float, float], dist2:float, weights:[float, ...]) -> int C++: int EvaluatePosition(const double x[3], double closestPoint[3], int &subId, double pcoords[3], double &dist2, double weights[]) override; Given a point x[3] return inside(=1), outside(=0) cell, or (-1) computational problem encountered; evaluate parametric coordinates, sub-cell id (!=0 only if cell is composite), distance squared of point x[3] to cell (in particular, the sub-cell indicated), closest point on cell to x[3] (unless closestPoint is null, in which case, the closest point and dist2 are not found), and interpolation weights in cell. (The number of weights is equal to the number of points defining the cell). Note: on rare occasions a -1 is returned from the method. This means that numerical error has occurred and all data returned from this method should be ignored. Also, inside/outside is determine parametrically. That is, a point is inside if it satisfies parametric limits. This can cause problems for cells of topological dimension 2 or less, since a point in 3D can project onto the cell within parametric limits but be "far" from the cell. Thus the value dist2 may be checked to determine true in/out. """ pass def GetCellDimension(self): # real signature unknown; restored from __doc__ """ GetCellDimension(self) -> int C++: int GetCellDimension() override; The topological dimension of the cell. (Satisfies vtkCell API.) """ return 0 def GetCellType(self): # real signature unknown; restored from __doc__ """ GetCellType(self) -> int C++: int GetCellType() override; See the vtkCell API for descriptions of these methods. """ return 0 def GetCentroid(self, centroid, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ """ GetCentroid(self, centroid:[float, float, float]) -> bool C++: bool GetCentroid(double centroid[3]) override; Computes the centroid of the cell. """ pass def GetEdge(self, edgeId): # real signature unknown; restored from __doc__ """ GetEdge(self, edgeId:int) -> vtkCell C++: vtkCell *GetEdge(int edgeId) override; Return the edge cell from the edgeId of the cell. """ return vtkCell def GetEdgeArray(self, edgeId): # real signature unknown; restored from __doc__ """ GetEdgeArray(edgeId:int) -> (int, int) C++: static const vtkIdType *GetEdgeArray(vtkIdType edgeId) Return the ids of the vertices defining edge/face (`edgeId`/`faceId'). Ids are related to the cell, not to the dataset. ote 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. """ pass def GetEdgePoints(self, edgeId, pts, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ """ GetEdgePoints(self, edgeId:int, pts:(int, ...)) -> None C++: void GetEdgePoints(vtkIdType edgeId, const vtkIdType *&pts) override; See vtkCell3D API for description of these methods. """ pass def GetEdgeToAdjacentFaces(self, edgeId, pts, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ """ GetEdgeToAdjacentFaces(self, edgeId:int, pts:(int, ...)) -> None C++: void GetEdgeToAdjacentFaces(vtkIdType edgeId, const vtkIdType *&pts) override; Get the ids of the two adjacent faces to edge of id edgeId. The output face ids are sorted from id of lowest rank to highest. Note that the faces are 0-offset; that is, they refer to the ids of the cells, not the face ids of the mesh that the cell belongs to. The edgeId must range between 0<=edgeIdGetNumberOfEdges(). """ pass def GetEdgeToAdjacentFacesArray(self, edgeId): # real signature unknown; restored from __doc__ """ GetEdgeToAdjacentFacesArray(edgeId:int) -> (int, int) C++: static const vtkIdType *GetEdgeToAdjacentFacesArray( vtkIdType edgeId) Static method version of GetEdgeToAdjacentFaces. """ pass def GetFace(self, faceId): # real signature unknown; restored from __doc__ """ GetFace(self, faceId:int) -> vtkCell C++: vtkCell *GetFace(int faceId) override; Return the face cell from the faceId of the cell. The returned vtkCell is an object owned by this instance, hence the return value must not be deleted by the caller. @warning Repeat calls to this function for different face ids will change the data stored in the internal member object whose pointer is returned by this function. @warning THIS METHOD IS NOT THREAD SAFE. """ return vtkCell def GetFaceArray(self, faceId): # real signature unknown; restored from __doc__ """ GetFaceArray(faceId:int) -> (int) C++: static const vtkIdType *GetFaceArray(vtkIdType faceId) """ pass def GetFacePoints(self, faceId, pts, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ """ GetFacePoints(self, faceId:int, pts:(int, ...)) -> int C++: vtkIdType GetFacePoints(vtkIdType faceId, const vtkIdType *&pts) override; Get the list of vertices that define a face. The list is terminated with a negative number. Note that the vertices are 0-offset; that is, they refer to the ids of the cell, not the point ids of the mesh that the cell belongs to. The faceId must range between 0<=faceIdGetNumberOfFaces(). @return The number of points in face faceId """ pass def GetFaceToAdjacentFaces(self, faceId, faceIds, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ """ GetFaceToAdjacentFaces(self, faceId:int, faceIds:(int, ...)) -> int C++: vtkIdType GetFaceToAdjacentFaces(vtkIdType faceId, const vtkIdType *&faceIds) override; Get the ids of the adjacent faces to face of id faceId. The order of faces is consistent. They are always ordered in counter clockwise w.r.t. normal orientation. The first id faces[0] corresponds to the face sharing point of id pts[0] where pts is obtained from this->GetFacePoints(faceId, pts), being the "most counter clockwise" oriented w.r.t. face faceId. Note that the faces are 0-offset; that is, they refer to the ids of the cell, not the face ids of the mesh that the cell belongs to. The faceId must be between 0<=faceIdGetNumberOfFaces(); @warning If the vtkCell3D is "inside out", i.e. normals point inside the cell, the order is inverted. @return The number of adjacent faces to faceId. """ pass def GetFaceToAdjacentFacesArray(self, faceId): # real signature unknown; restored from __doc__ """ GetFaceToAdjacentFacesArray(faceId:int) -> (int, int, int, int) C++: static const vtkIdType *GetFaceToAdjacentFacesArray( vtkIdType faceId) Static method version of GetFaceToAdjacentFaces. """ pass def GetNumberOfEdges(self): # real signature unknown; restored from __doc__ """ GetNumberOfEdges(self) -> int C++: int GetNumberOfEdges() override; Return the number of edges in the cell. """ return 0 def GetNumberOfFaces(self): # real signature unknown; restored from __doc__ """ GetNumberOfFaces(self) -> int C++: int GetNumberOfFaces() override; Return the number of faces in the cell. """ return 0 def GetNumberOfGenerationsFromBase(self, type): # real signature unknown; restored from __doc__ """ GetNumberOfGenerationsFromBase(self, type:str) -> int C++: vtkIdType GetNumberOfGenerationsFromBase(const char *type) override; Given the name of a base class of this class type, return the distance of inheritance between this class type and the named class (how many generations of inheritance are there between this class and the named class). If the named class is not in this class's inheritance tree, return a negative value. Valid responses will always be nonnegative. This method works in combination with vtkTypeMacro found in vtkSetGet.h. """ return 0 def GetNumberOfGenerationsFromBaseType(self, type): # real signature unknown; restored from __doc__ """ GetNumberOfGenerationsFromBaseType(type:str) -> int C++: static vtkIdType GetNumberOfGenerationsFromBaseType( const char *type) Given a the name of a base class of this class type, return the distance of inheritance between this class type and the named class (how many generations of inheritance are there between this class and the named class). If the named class is not in this class's inheritance tree, return a negative value. Valid responses will always be nonnegative. This method works in combination with vtkTypeMacro found in vtkSetGet.h. """ return 0 def GetParametricCenter(self, pcoords, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ """ GetParametricCenter(self, pcoords:[float, float, float]) -> int C++: int GetParametricCenter(double pcoords[3]) override; Return the center of the wedge in parametric coordinates. """ pass def GetParametricCoords(self): # real signature unknown; restored from __doc__ """ GetParametricCoords(self) -> (float, ...) C++: double *GetParametricCoords() override; Return a contiguous array of parametric coordinates of the points defining this 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. This method returns a non-nullptr pointer when the cell is a primary type (i.e., IsPrimaryCell() is true). Note that 3D parametric coordinates are returned no matter what the topological dimension of the cell. """ pass def GetPointToIncidentEdges(self, pointId, edgeIds, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ """ GetPointToIncidentEdges(self, pointId:int, edgeIds:(int, ...)) -> int C++: vtkIdType GetPointToIncidentEdges(vtkIdType pointId, const vtkIdType *&edgeIds) override; Get the ids of the incident edges to point of id pointId. Edges are sorted in counter clockwise order w.r.t. bisectrix pointing outside the cell at point of id pointId. The first edge corresponds to the edge containing point of id pts[0], where pts is obtained from this->GetPointToOnRingVertices(pointId, pts). Note that the edges are 0-offset; that is, they refer to the ids of the cell, not the edge ids of the mesh that the cell belongs to. The edgeId must be between 0<=edgeIdGetNumberOfEdges(); @warning If the vtkCell3D is "inside out", i.e. normals point inside the cell, the order is inverted. @return The valence of point pointId. """ pass def GetPointToIncidentEdgesArray(self, pointId): # real signature unknown; restored from __doc__ """ GetPointToIncidentEdgesArray(pointId:int) -> (int, int, int) C++: static const vtkIdType *GetPointToIncidentEdgesArray( vtkIdType pointId) Static method version of GetPointToIncidentEdgesArray. """ pass def GetPointToIncidentFaces(self, pointId, faceIds, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ """ GetPointToIncidentFaces(self, pointId:int, faceIds:(int, ...)) -> int C++: vtkIdType GetPointToIncidentFaces(vtkIdType pointId, const vtkIdType *&faceIds) override; Get the ids of the incident faces point of id pointId. Faces are sorted in counter clockwise order w.r.t. bisectrix pointing outside the cell at point of id pointId. The first face corresponds to the face containing edge of id edges[0], where edges is obtained from this->GetPointToIncidentEdges(pointId, edges), such that face faces[0] is the "most counterclockwise" face incident to point pointId containing edges[0]. Note that the faces are 0-offset; that is, they refer to the ids of the cell, not the face ids of the mesh that the cell belongs to. The pointId must be between 0<=pointIdGetNumberOfPoints(). @warning If the vtkCell3D is "inside out", i.e. normals point inside the cell, the order is inverted. @return The valence of point pointId. """ pass def GetPointToIncidentFacesArray(self, pointId): # real signature unknown; restored from __doc__ """ GetPointToIncidentFacesArray(pointId:int) -> (int, int, int) C++: static const vtkIdType *GetPointToIncidentFacesArray( vtkIdType pointId) Static method version of GetPointToIncidentFacesArray. """ pass def GetPointToOneRingPoints(self, pointId, pts, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ """ GetPointToOneRingPoints(self, pointId:int, pts:(int, ...)) -> int C++: vtkIdType GetPointToOneRingPoints(vtkIdType pointId, const vtkIdType *&pts) override; Get the ids of a one-ring surrounding point of id pointId. Points are sorted in counter clockwise order w.r.t. bisectrix pointing outside the cell at point of id pointId. The first point corresponds to the point contained in edges[0], where edges is obtained from this->GetPointToIncidentEdges(pointId, edges). Note that the points are 0-offset; that is, they refer to the ids of the cell, not the point ids of the mesh that the cell belongs to. The pointId must be between 0GetNumberOfPoints(). @return The valence of point pointId. """ pass def GetPointToOneRingPointsArray(self, pointId): # real signature unknown; restored from __doc__ """ GetPointToOneRingPointsArray(pointId:int) -> (int, int, int) C++: static const vtkIdType *GetPointToOneRingPointsArray( vtkIdType pointId) Static method version of GetPointToOneRingPoints. """ pass def GetTriangleCases(self, caseId): # real signature unknown; restored from __doc__ """ GetTriangleCases(caseId:int) -> Pointer C++: static int *GetTriangleCases(int caseId) Return the case table for table-based isocontouring (aka marching cubes style implementations). A linear 3D cell with N vertices will have 2**N cases. The returned case array lists three edges in order to produce one output triangle which may be repeated to generate multiple triangles. The list of cases terminates with a -1 entry. """ pass def InterpolateDerivs(self, pcoords, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ """ InterpolateDerivs(self, pcoords:(float, float, float), derivs:[float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float]) -> None C++: void InterpolateDerivs(const double pcoords[3], double derivs[18]) override; """ pass def InterpolateFunctions(self, pcoords, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ """ InterpolateFunctions(self, pcoords:(float, float, float), weights:[float, float, float, float, float, float]) -> None C++: void InterpolateFunctions(const double pcoords[3], double weights[6]) override; Compute the interpolation functions/derivatives (aka shape functions/derivatives) """ pass def InterpolationDerivs(self, pcoords, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ """ InterpolationDerivs(pcoords:(float, float, float), derivs:[float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float, float]) -> None C++: static void InterpolationDerivs(const double pcoords[3], double derivs[18]) """ pass def InterpolationFunctions(self, pcoords, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ """ InterpolationFunctions(pcoords:(float, float, float), weights:[float, float, float, float, float, float]) -> None C++: static void InterpolationFunctions(const double pcoords[3], double weights[6]) """ pass def IntersectWithLine(self, p1, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ """ IntersectWithLine(self, p1:(float, float, float), p2:(float, float, float), tol:float, t:float, x:[float, float, float], pcoords:[float, float, float], subId:int) -> int C++: int IntersectWithLine(const double p1[3], const double p2[3], double tol, double &t, double x[3], double pcoords[3], int &subId) override; Intersect with a ray. Return parametric coordinates (both line and cell) and global intersection coordinates, given ray definition p1[3], p2[3] and tolerance tol. The method returns non-zero value if intersection occurs. A parametric distance t between 0 and 1 along the ray representing the intersection point, the point coordinates x[3] in data coordinates and also pcoords[3] in parametric coordinates. subId is the index within the cell if a composed cell like a triangle strip. """ pass def IsA(self, type): # real signature unknown; restored from __doc__ """ IsA(self, type:str) -> int C++: vtkTypeBool IsA(const char *type) override; Return 1 if this class is the same type of (or a subclass of) the named class. Returns 0 otherwise. This method works in combination with vtkTypeMacro found in vtkSetGet.h. """ return 0 def IsInsideOut(self): # real signature unknown; restored from __doc__ """ IsInsideOut(self) -> bool C++: bool IsInsideOut() override; Returns true if the normals of the vtkCell3D point inside the cell. @warning This flag is not precomputed. It is advised for the return result of this method to be stored in a local boolean by the user if needed multiple times. """ return False def IsTypeOf(self, type): # real signature unknown; restored from __doc__ """ IsTypeOf(type:str) -> int C++: static vtkTypeBool IsTypeOf(const char *type) Return 1 if this class type is the same type of (or a subclass of) the named class. Returns 0 otherwise. This method works in combination with vtkTypeMacro found in vtkSetGet.h. """ return 0 def NewInstance(self): # real signature unknown; restored from __doc__ """ NewInstance(self) -> vtkWedge C++: vtkWedge *NewInstance() """ return vtkWedge def SafeDownCast(self, o): # real signature unknown; restored from __doc__ """ SafeDownCast(o:vtkObjectBase) -> vtkWedge C++: static vtkWedge *SafeDownCast(vtkObjectBase *o) """ return vtkWedge def Triangulate(self, index, ptIds, pts): # real signature unknown; restored from __doc__ """ Triangulate(self, index:int, ptIds:vtkIdList, pts:vtkPoints) -> int C++: int Triangulate(int index, vtkIdList *ptIds, vtkPoints *pts) override; Generate simplices of proper dimension. If cell is 3D, tetrahedron are generated; if 2D triangles; if 1D lines; if 0D points. The form of the output is a sequence of points, each n+1 points (where n is topological cell dimension) defining a simplex. The index is a parameter that controls which triangulation to use (if more than one is possible). If numerical degeneracy encountered, 0 is returned, otherwise 1 is returned. This method does not insert new points: all the points that define the simplices are the points that define the cell. """ return 0 def __delattr__(self, *args, **kwargs): # real signature unknown """ Implement delattr(self, name). """ pass def __getattribute__(self, *args, **kwargs): # real signature unknown """ Return getattr(self, name). """ pass def __init__(self, *args, **kwargs): # real signature unknown pass @staticmethod # known case of __new__ def __new__(*args, **kwargs): # real signature unknown """ Create and return a new object. See help(type) for accurate signature. """ pass def __repr__(self, *args, **kwargs): # real signature unknown """ Return repr(self). """ pass def __setattr__(self, *args, **kwargs): # real signature unknown """ Implement setattr(self, name, value). """ pass def __str__(self, *args, **kwargs): # real signature unknown """ Return str(self). """ pass __this__ = property(lambda self: object(), lambda self, v: None, lambda self: None) # default """Pointer to the C++ object.""" __dict__ = None # (!) real value is "mappingproxy({'__vtkname__': 'vtkWedge', 'IsTypeOf': , 'IsA': , 'SafeDownCast': , 'NewInstance': , 'GetNumberOfGenerationsFromBaseType': , 'GetNumberOfGenerationsFromBase': , 'GetEdgePoints': , 'GetFacePoints': , 'GetEdgeToAdjacentFaces': , 'GetFaceToAdjacentFaces': , 'GetPointToIncidentEdges': , 'GetPointToIncidentFaces': , 'GetPointToOneRingPoints': , 'GetCentroid': , 'IsInsideOut': , 'GetCellType': , 'GetCellDimension': , 'GetNumberOfEdges': , 'GetNumberOfFaces': , 'GetEdge': , 'GetFace': , 'CellBoundary': , 'Contour': , 'EvaluatePosition': , 'EvaluateLocation': , 'IntersectWithLine': , 'Triangulate': , 'Derivatives': , 'GetParametricCoords': , 'GetTriangleCases': , 'GetParametricCenter': , 'InterpolationFunctions': , 'InterpolationDerivs': , 'InterpolateFunctions': , 'InterpolateDerivs': , 'GetEdgeArray': , 'GetFaceArray': , 'GetEdgeToAdjacentFacesArray': , 'GetFaceToAdjacentFacesArray': , 'GetPointToIncidentEdgesArray': , 'GetPointToIncidentFacesArray': , 'GetPointToOneRingPointsArray': , 'ComputeCentroid': , '__new__': , '__repr__': , '__str__': , '__getattribute__': , '__setattr__': , '__delattr__': , '__dict__': , '__this__': , '__doc__': 'vtkWedge - a 3D cell that represents a linear wedge\\n\\nSuperclass: vtkCell3D\\n\\nvtkWedge is a concrete implementation of vtkCell to represent a\\nlinear 3D wedge. A wedge consists of two triangular and three\\nquadrilateral faces and is defined by the six points (0-5). vtkWedge\\nuses the standard isoparametric shape functions for a linear wedge.\\nThe wedge is defined by the six points (0-5) where (0,1,2) is the\\nbase of the wedge which, using the right hand rule, forms a triangle\\nwhose normal points outward (away from the triangular face (3,4,5)).\\n\\n@sa\\nvtkConvexPointSet vtkHexahedron vtkPyramid vtkTetra vtkVoxel\\n\\n'})" __vtkname__ = 'vtkWedge'