# 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 class vtkCell(__vtkmodules_vtkCommonCore.vtkObject): """ vtkCell - abstract class to specify cell behavior Superclass: vtkObject vtkCell is an abstract class that specifies the interfaces for data cells. Data cells are simple topological elements like points, lines, polygons, and tetrahedra of which visualization datasets are composed. In some cases visualization datasets may explicitly represent cells (e.g., vtkPolyData, vtkUnstructuredGrid), and in some cases, the datasets are implicitly composed of cells (e.g., vtkStructuredPoints). @warning The #define VTK_CELL_SIZE is a parameter used to construct cells and provide a general guideline for controlling object execution. This parameter is not a hard boundary: you can create cells with more points. @sa vtkHexahedron vtkLine vtkPixel vtkPolyLine vtkPolyVertex vtkPolygon vtkQuad vtkTetra vtkTriangle vtkTriangleStrip vtkVertex vtkVoxel vtkWedge vtkPyramid """ 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++: virtual int CellBoundary(int subId, const double pcoords[3], vtkIdList *pts) 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 Clip(self, value, cellScalars, locator, connectivity, inPd, outPd, inCd, cellId, outCd, insideOut): # real signature unknown; restored from __doc__ """ Clip(self, value:float, cellScalars:vtkDataArray, locator:vtkIncrementalPointLocator, connectivity:vtkCellArray, inPd:vtkPointData, outPd:vtkPointData, inCd:vtkCellData, cellId:int, outCd:vtkCellData, insideOut:int) -> None C++: virtual void Clip(double value, vtkDataArray *cellScalars, vtkIncrementalPointLocator *locator, vtkCellArray *connectivity, vtkPointData *inPd, vtkPointData *outPd, vtkCellData *inCd, vtkIdType cellId, vtkCellData *outCd, int insideOut) Cut (or clip) the cell based on the input cellScalars and the specified value. The output of the clip operation will be one or more cells of the same topological dimension as the original cell. The flag insideOut controls what part of the cell is considered inside - normally cell points whose scalar value is greater than "value" are considered inside. If insideOut is on, this is reversed. Also, if the output cell data is non-nullptr, the cell data from the clipped 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 ComputeBoundingSphere(self, center, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ """ ComputeBoundingSphere(self, center:[float, float, float]) -> float C++: virtual double ComputeBoundingSphere(double center[3]) Computes the bounding sphere of the cell. If the number of points in the cell is lower or equal to 4, an exact bounding sphere is computed. If not, Ritter's algorithm is followed. If the input sphere has zero points, then each coordinate of center is set to NaN, as well as the returned distance. This method computes the center of the sphere, and returns its squared radius. """ 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++: virtual void Contour(double value, vtkDataArray *cellScalars, vtkIncrementalPointLocator *locator, vtkCellArray *verts, vtkCellArray *lines, vtkCellArray *polys, vtkPointData *inPd, vtkPointData *outPd, vtkCellData *inCd, vtkIdType cellId, vtkCellData *outCd) 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 DeepCopy(self, c): # real signature unknown; restored from __doc__ """ DeepCopy(self, c:vtkCell) -> None C++: virtual void DeepCopy(vtkCell *c) Copy this cell by completely copying internal data structures. This is slower but safer than ShallowCopy(). """ 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++: virtual void Derivatives(int subId, const double pcoords[3], const double *values, int dim, double *derivs) 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++: virtual void EvaluateLocation(int &subId, const double pcoords[3], double x[3], double *weights) 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++: virtual int EvaluatePosition(const double x[3], double closestPoint[3], int &subId, double pcoords[3], double &dist2, double weights[]) 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 GetBounds(self, bounds, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ """ GetBounds(self, bounds:[float, float, float, float, float, float]) -> None C++: void GetBounds(double bounds[6]) GetBounds(self) -> (float, float, float, float, float, float) C++: double *GetBounds() Compute cell bounding box (xmin,xmax,ymin,ymax,zmin,zmax). Copy result into user provided array. """ pass def GetCellDimension(self): # real signature unknown; restored from __doc__ """ GetCellDimension(self) -> int C++: virtual int GetCellDimension() Return the topological dimensional of the cell (0,1,2, or 3). """ return 0 def GetCellType(self): # real signature unknown; restored from __doc__ """ GetCellType(self) -> int C++: virtual int GetCellType() Return the type of cell. """ return 0 def GetEdge(self, edgeId): # real signature unknown; restored from __doc__ """ GetEdge(self, edgeId:int) -> vtkCell C++: virtual vtkCell *GetEdge(int edgeId) Return the edge cell from the edgeId of the cell. """ return vtkCell def GetFace(self, faceId): # real signature unknown; restored from __doc__ """ GetFace(self, faceId:int) -> vtkCell C++: virtual vtkCell *GetFace(int faceId) 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 GetFaces(self): # real signature unknown; restored from __doc__ """ GetFaces(self) -> Pointer C++: virtual vtkIdType *GetFaces() """ pass def GetLength2(self): # real signature unknown; restored from __doc__ """ GetLength2(self) -> float C++: double GetLength2() Compute Length squared of cell (i.e., bounding box diagonal squared). """ return 0.0 def GetNumberOfEdges(self): # real signature unknown; restored from __doc__ """ GetNumberOfEdges(self) -> int C++: virtual int GetNumberOfEdges() Return the number of edges in the cell. """ return 0 def GetNumberOfFaces(self): # real signature unknown; restored from __doc__ """ GetNumberOfFaces(self) -> int C++: virtual int GetNumberOfFaces() 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 GetNumberOfPoints(self): # real signature unknown; restored from __doc__ """ GetNumberOfPoints(self) -> int C++: vtkIdType GetNumberOfPoints() Return the number of points in the cell. """ return 0 def GetParametricCenter(self, pcoords, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ """ GetParametricCenter(self, pcoords:[float, float, float]) -> int C++: virtual int GetParametricCenter(double pcoords[3]) Return center of the cell in parametric coordinates. Note that the parametric center is not always located at (0.5,0.5,0.5). The return value is the subId that the center is in (if a composite cell). If you want the center in x-y-z space, invoke the EvaluateLocation() method. """ pass def GetParametricCoords(self): # real signature unknown; restored from __doc__ """ GetParametricCoords(self) -> (float, ...) C++: virtual double *GetParametricCoords() 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 GetParametricDistance(self, pcoords, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ """ GetParametricDistance(self, pcoords:(float, float, float)) -> float C++: virtual double GetParametricDistance(const double pcoords[3]) Return the distance of the parametric coordinate provided to the 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.) """ pass def GetPointId(self, ptId): # real signature unknown; restored from __doc__ """ GetPointId(self, ptId:int) -> int C++: vtkIdType GetPointId(int ptId) For cell point i, return the actual point id. """ return 0 def GetPointIds(self): # real signature unknown; restored from __doc__ """ GetPointIds(self) -> vtkIdList C++: vtkIdList *GetPointIds() Return the list of point ids defining the cell. """ pass def GetPoints(self): # real signature unknown; restored from __doc__ """ GetPoints(self) -> vtkPoints C++: vtkPoints *GetPoints() Get the point coordinates for the cell. """ pass def Inflate(self, dist): # real signature unknown; restored from __doc__ """ Inflate(self, dist:float) -> int C++: virtual int Inflate(double dist) Inflates the cell. Each edge is displaced following its normal by a distance of value `dist`. If dist is negative, then the cell shrinks. The resulting cell edges / faces are colinear / coplanar to their previous self. The cell is assumed to be non-degenerate and to have no edge of length zero for linear 2D cells. If it is not the case, then no inflation is performed. This method needs to be overridden by inheriting non-linear / non-2D cells. \return 1 if inflation was successful, 0 if no inflation was performed """ return 0 def Initialize(self, npts, pts, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ """ Initialize(self, npts:int, pts:(int, ...), p:vtkPoints) -> None C++: void Initialize(int npts, const vtkIdType *pts, vtkPoints *p) Initialize(self, npts:int, p:vtkPoints) -> None C++: void Initialize(int npts, vtkPoints *p) Initialize(self) -> None C++: virtual void Initialize() Initialize cell from outside with point ids and point coordinates specified. """ pass def InterpolateDerivs(self, pcoords, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ """ InterpolateDerivs(self, pcoords:(float, float, float), derivs:[float, ...]) -> None C++: virtual void InterpolateDerivs(const double pcoords[3], double *derivs) """ pass def InterpolateFunctions(self, pcoords, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ """ InterpolateFunctions(self, pcoords:(float, float, float), weight:[float, ...]) -> None C++: virtual void InterpolateFunctions(const double pcoords[3], double *weight) Compute the interpolation functions/derivatives (aka shape functions/derivatives) No-ops at this level. Typically overridden in subclasses. """ pass def IntersectWithCell(self, other, tol=0.0): # real signature unknown; restored from __doc__ """ IntersectWithCell(self, other:vtkCell, tol:float=0.0) -> int C++: virtual int IntersectWithCell(vtkCell *other, double tol=0.0) IntersectWithCell(self, other:vtkCell, boudingBox:vtkBoundingBox, otherBoundingBox:vtkBoundingBox, tol:float=0.0) -> int C++: virtual int IntersectWithCell(vtkCell *other, const vtkBoundingBox &boudingBox, const vtkBoundingBox &otherBoundingBox, double tol=0.0) Intersects with an other cell. Returns 1 if cells intersect, 0 otherwise. If an exact intersection detection with regards to floating point precision is wanted, tol should be disregarded. `vtkBoundingBox` are optional parameters which slightly improve the speed of the computation if bounding boxes are already available to user. """ return 0 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++: virtual int IntersectWithLine(const double p1[3], const double p2[3], double tol, double &t, double x[3], double pcoords[3], int &subId) 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 IsExplicitCell(self): # real signature unknown; restored from __doc__ """ IsExplicitCell(self) -> int C++: virtual int IsExplicitCell() Explicit cells require additional representational information beyond the usual cell type and connectivity list information. Most cells in VTK are implicit cells. """ return 0 def IsLinear(self): # real signature unknown; restored from __doc__ """ IsLinear(self) -> int C++: virtual int IsLinear() Non-linear cells require special treatment beyond the usual cell type and connectivity list information. Most cells in VTK are implicit cells. """ return 0 def IsPrimaryCell(self): # real signature unknown; restored from __doc__ """ IsPrimaryCell(self) -> int C++: virtual int IsPrimaryCell() Return whether this cell type has a fixed topology or whether the topology varies depending on the data (e.g., vtkConvexPointSet). This compares to composite cells that are typically composed of primary cells (e.g., a triangle strip composite cell is made up of triangle primary cells). """ return 0 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) -> vtkCell C++: vtkCell *NewInstance() """ return vtkCell def RequiresExplicitFaceRepresentation(self): # real signature unknown; restored from __doc__ """ RequiresExplicitFaceRepresentation(self) -> int C++: virtual int RequiresExplicitFaceRepresentation() Determine whether the cell requires explicit face representation, and methods for setting and getting the faces (see vtkPolyhedron for example usage of these methods). """ return 0 def RequiresInitialization(self): # real signature unknown; restored from __doc__ """ RequiresInitialization(self) -> int C++: virtual int RequiresInitialization() Some cells require initialization prior to access. For example, they may have to triangulate themselves or set up internal data structures. """ return 0 def SafeDownCast(self, o): # real signature unknown; restored from __doc__ """ SafeDownCast(o:vtkObjectBase) -> vtkCell C++: static vtkCell *SafeDownCast(vtkObjectBase *o) """ return vtkCell def SetFaces(self, faces, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ """ SetFaces(self, faces:[int, ...]) -> None C++: virtual void SetFaces(vtkIdType *faces) """ pass def ShallowCopy(self, c): # real signature unknown; restored from __doc__ """ ShallowCopy(self, c:vtkCell) -> None C++: virtual void ShallowCopy(vtkCell *c) Copy this cell by reference counting the internal data structures. This is safe if you want a "read-only" copy. If you modify the cell you might wish to use DeepCopy(). """ pass def Triangulate(self, index, ptIds, pts): # real signature unknown; restored from __doc__ """ Triangulate(self, index:int, ptIds:vtkIdList, pts:vtkPoints) -> int C++: virtual int Triangulate(int index, vtkIdList *ptIds, vtkPoints *pts) 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__': 'vtkCell', 'IsTypeOf': , 'IsA': , 'SafeDownCast': , 'NewInstance': , 'GetNumberOfGenerationsFromBaseType': , 'GetNumberOfGenerationsFromBase': , 'Initialize': , 'ShallowCopy': , 'DeepCopy': , 'GetCellType': , 'GetCellDimension': , 'IsLinear': , 'RequiresInitialization': , 'IsExplicitCell': , 'RequiresExplicitFaceRepresentation': , 'SetFaces': , 'GetFaces': , 'GetPoints': , 'GetNumberOfPoints': , 'GetNumberOfEdges': , 'GetNumberOfFaces': , 'GetPointIds': , 'GetPointId': , 'GetEdge': , 'GetFace': , 'CellBoundary': , 'EvaluatePosition': , 'EvaluateLocation': , 'Contour': , 'Clip': , 'Inflate': , 'ComputeBoundingSphere': , 'IntersectWithLine': , 'IntersectWithCell': , 'Triangulate': , 'Derivatives': , 'GetBounds': , 'GetLength2': , 'GetParametricCenter': , 'GetParametricDistance': , 'IsPrimaryCell': , 'GetParametricCoords': , 'InterpolateFunctions': , 'InterpolateDerivs': , '__new__': , '__repr__': , '__str__': , '__getattribute__': , '__setattr__': , '__delattr__': , '__dict__': , '__this__': , '__doc__': 'vtkCell - abstract class to specify cell behavior\\n\\nSuperclass: vtkObject\\n\\nvtkCell is an abstract class that specifies the interfaces for data\\ncells. Data cells are simple topological elements like points, lines,\\npolygons, and tetrahedra of which visualization datasets are\\ncomposed. In some cases visualization datasets may explicitly\\nrepresent cells (e.g., vtkPolyData, vtkUnstructuredGrid), and in some\\ncases, the datasets are implicitly composed of cells (e.g.,\\nvtkStructuredPoints).\\n\\n@warning\\nThe #define VTK_CELL_SIZE is a parameter used to construct cells and\\nprovide a general guideline for controlling object execution. This\\nparameter is not a hard boundary: you can create cells with more\\npoints.\\n\\n@sa\\nvtkHexahedron vtkLine vtkPixel vtkPolyLine vtkPolyVertex vtkPolygon\\nvtkQuad vtkTetra vtkTriangle vtkTriangleStrip vtkVertex vtkVoxel\\nvtkWedge vtkPyramid\\n\\n'})" __vtkname__ = 'vtkCell'