# 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 .vtkCell import vtkCell class vtkTriangle(vtkCell): """ vtkTriangle - a cell that represents a triangle Superclass: vtkCell vtkTriangle is a concrete implementation of vtkCell to represent a triangle located in 3-space. """ def BarycentricCoords(self, x, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ """ BarycentricCoords(x:(float, float), x1:(float, float), x2:(float, float), x3:(float, float), bcoords:[float, float, float]) -> int C++: static int BarycentricCoords(const double x[2], const double x1[2], const double x2[2], const double x3[2], double bcoords[3]) Given a 2D point x[2], determine the barycentric coordinates of the point. Barycentric coordinates are a natural coordinate system for simplices that express a position as a linear combination of the vertices. For a triangle, there are three barycentric coordinates (because there are three vertices), and the sum of the coordinates must equal 1. If a point x is inside a simplex, then all three coordinates will be strictly positive. If two coordinates are zero (so the third =1), then the point x is on a vertex. If one coordinates are zero, the point x is on an edge. In this method, you must specify the vertex coordinates x1->x3. Returns 0 if triangle is degenerate. """ pass 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 Circumcircle(self, p1, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ """ Circumcircle(p1:(float, float), p2:(float, float), p3:(float, float), center:[float, float]) -> float C++: static double Circumcircle(const double p1[2], const double p2[2], const double p3[2], double center[2]) Compute the circumcenter (center[3]) and radius squared (method return value) of a triangle defined by the three points x1, x2, and x3. (Note that the coordinates are 2D. 3D points can be used but the z-component will be ignored.) """ pass def Clip(self, value, cellScalars, locator, polys, inPd, outPd, inCd, cellId, outCd, insideOut): # real signature unknown; restored from __doc__ """ Clip(self, value:float, cellScalars:vtkDataArray, locator:vtkIncrementalPointLocator, polys:vtkCellArray, inPd:vtkPointData, outPd:vtkPointData, inCd:vtkCellData, cellId:int, outCd:vtkCellData, insideOut:int) -> None C++: void Clip(double value, vtkDataArray *cellScalars, vtkIncrementalPointLocator *locator, vtkCellArray *polys, vtkPointData *inPd, vtkPointData *outPd, vtkCellData *inCd, vtkIdType cellId, vtkCellData *outCd, int insideOut) override; Clip this triangle using scalar value provided. Like contouring, except that it cuts the triangle to produce other triangles. """ pass def ComputeArea(self): # real signature unknown; restored from __doc__ """ ComputeArea(self) -> float C++: double ComputeArea() A convenience function to compute the area of a vtkTriangle. """ return 0.0 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]) Get the centroid of the triangle. pointIds can be nullptr if ids are {0, 1, 2} """ pass def ComputeNormal(self, p, numPts, pts, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ """ ComputeNormal(p:vtkPoints, numPts:int, pts:(int, ...), n:[float, float, float]) -> None C++: static void ComputeNormal(vtkPoints *p, int numPts, const vtkIdType *pts, double n[3]) ComputeNormal(v1:(float, float, float), v2:(float, float, float), v3:(float, float, float), n:[float, float, float]) -> None C++: static void ComputeNormal(const double v1[3], const double v2[3], const double v3[3], double n[3]) Compute the triangle normal from a points list, and a list of point ids that index into the points list. """ pass def ComputeNormalDirection(self, v1, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ """ ComputeNormalDirection(v1:(float, float, float), v2:(float, float, float), v3:(float, float, float), n:[float, float, float]) -> None C++: static void ComputeNormalDirection(const double v1[3], const double v2[3], const double v3[3], double n[3]) Compute the (unnormalized) triangle normal direction from three points. """ pass def ComputeQuadric(self, x1, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ """ ComputeQuadric(x1:(float, float, float), x2:(float, float, float), x3:(float, float, float), quadric:[[float, float, float, float], [float, float, float, float], [float, float, float, float], [float, float, float, float]]) -> None C++: static void ComputeQuadric(const double x1[3], const double x2[3], const double x3[3], double quadric[4][4]) ComputeQuadric(x1:(float, float, float), x2:(float, float, float), x3:(float, float, float), quadric:vtkQuadric) -> None C++: static void ComputeQuadric(const double x1[3], const double x2[3], const double x3[3], vtkQuadric *quadric) Calculate the error quadric for this triangle. Return the quadric as a 4x4 matrix or a vtkQuadric. (from Peter Lindstrom's Siggraph 2000 paper, "Out-of-Core Simplification of Large Polygonal Models") """ 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; 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++: int GetCellType() override; See the vtkCell API for descriptions of these methods. """ return 0 def GetEdge(self, edgeId): # real signature unknown; restored from __doc__ """ GetEdge(self, edgeId:int) -> vtkCell C++: vtkCell *GetEdge(int edgeId) override; Get the edge specified by edgeId (range 0 to 2) and return that edge's coordinates. """ return vtkCell def GetEdgeArray(self, edgeId): # real signature unknown; restored from __doc__ """ GetEdgeArray(self, edgeId:int) -> Pointer C++: const vtkIdType *GetEdgeArray(vtkIdType edgeId) Return the ids of the vertices defining edge (`edgeId`). 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 GetFace(self, __a): # real signature unknown; restored from __doc__ """ GetFace(self, __a:int) -> vtkCell C++: vtkCell *GetFace(int) 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 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 triangle 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 GetParametricDistance(self, pcoords, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ """ GetParametricDistance(self, pcoords:(float, float, float)) -> float C++: double GetParametricDistance(const double pcoords[3]) override; Return the distance of the parametric coordinate provided to the cell. If inside the cell, a distance of zero is returned. """ 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]) -> None C++: void InterpolateDerivs(const double pcoords[3], double derivs[6]) override; """ pass def InterpolateFunctions(self, pcoords, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ """ InterpolateFunctions(self, pcoords:(float, float, float), sf:[float, float, float]) -> None C++: void InterpolateFunctions(const double pcoords[3], double sf[3]) 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]) -> None C++: static void InterpolationDerivs(const double pcoords[3], double derivs[6]) """ pass def InterpolationFunctions(self, pcoords, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ """ InterpolationFunctions(pcoords:(float, float, float), sf:[float, float, float]) -> None C++: static void InterpolationFunctions(const double pcoords[3], double sf[3]) """ 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; Given a line defined by two points p1 and p2, determine whether it intersects the triangle. The tolerance tol is used to verify whether the intersection is inside or outside of the triangle. If the line and triangle are coplanar and there is intersection, the intersecting point is chosen as the point closest to p1 that is inside the triangle. """ 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 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) -> vtkTriangle C++: vtkTriangle *NewInstance() """ return vtkTriangle def PointInTriangle(self, x, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ """ PointInTriangle(x:(float, float, float), x1:(float, float, float), x2:(float, float, float), x3:(float, float, float), tol2:float) -> int C++: static int PointInTriangle(const double x[3], const double x1[3], const double x2[3], const double x3[3], const double tol2) Given a point x, determine whether it is inside (within the tolerance squared, tol2) the triangle defined by the three coordinate values p1, p2, p3. Method is via comparing dot products. (Note: in current implementation the tolerance only works in the neighborhood of the three vertices of the triangle. """ pass def ProjectTo2D(self, x1, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ """ ProjectTo2D(x1:(float, float, float), x2:(float, float, float), x3:(float, float, float), v1:[float, float], v2:[float, float], v3:[float, float]) -> int C++: static int ProjectTo2D(const double x1[3], const double x2[3], const double x3[3], double v1[2], double v2[2], double v3[2]) Project triangle defined in 3D to 2D coordinates. Returns 0 if degenerate triangle; non-zero value otherwise. Input points are x1->x3; output 2D points are v1->v3. """ pass def SafeDownCast(self, o): # real signature unknown; restored from __doc__ """ SafeDownCast(o:vtkObjectBase) -> vtkTriangle C++: static vtkTriangle *SafeDownCast(vtkObjectBase *o) """ return vtkTriangle def TriangleArea(self, p1, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ """ TriangleArea(p1:(float, float, float), p2:(float, float, float), p3:(float, float, float)) -> float C++: static double TriangleArea(const double p1[3], const double p2[3], const double p3[3]) Compute the area of a triangle in 3D. See also vtkTriangle::ComputeArea() """ pass def TriangleCenter(self, p1, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ """ TriangleCenter(p1:(float, float, float), p2:(float, float, float), p3:(float, float, float), center:[float, float, float]) -> None C++: static void TriangleCenter(const double p1[3], const double p2[3], const double p3[3], double center[3]) Compute the center of the triangle. """ pass def TrianglesIntersect(self, p1, *args, **kwargs): # real signature unknown; NOTE: unreliably restored from __doc__ """ TrianglesIntersect(p1:(float, float, float), q1:(float, float, float), r1:(float, float, float), p2:(float, float, float), q2:(float, float, float), r2:(float, float, float)) -> int C++: static int TrianglesIntersect(const double p1[3], const double q1[3], const double r1[3], const double p2[3], const double q2[3], const double r2[3]) Determine whether or not triangle (p1,q1,r1) intersects triangle (p2,q2,r2). This method is adapted from Olivier Devillers, Philippe Guigue. Faster Triangle-Triangle Intersection Tests. RR-4488, IN-RIA. 2002. . """ pass 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__': 'vtkTriangle', 'IsTypeOf': , 'IsA': , 'SafeDownCast': , 'NewInstance': , 'GetNumberOfGenerationsFromBaseType': , 'GetNumberOfGenerationsFromBase': , 'GetEdge': , 'GetCellType': , 'GetCellDimension': , 'GetNumberOfEdges': , 'GetNumberOfFaces': , 'GetFace': , 'CellBoundary': , 'Contour': , 'EvaluatePosition': , 'EvaluateLocation': , 'Triangulate': , 'Derivatives': , 'GetParametricCoords': , 'ComputeArea': , 'Clip': , 'InterpolationFunctions': , 'InterpolationDerivs': , 'InterpolateFunctions': , 'InterpolateDerivs': , 'GetEdgeArray': , 'IntersectWithLine': , 'GetParametricCenter': , 'GetParametricDistance': , 'TriangleCenter': , 'TriangleArea': , 'Circumcircle': , 'BarycentricCoords': , 'ProjectTo2D': , 'ComputeNormal': , 'ComputeNormalDirection': , 'TrianglesIntersect': , 'PointInTriangle': , 'ComputeQuadric': , 'ComputeCentroid': , '__new__': , '__repr__': , '__str__': , '__getattribute__': , '__setattr__': , '__delattr__': , '__dict__': , '__this__': , '__doc__': 'vtkTriangle - a cell that represents a triangle\\n\\nSuperclass: vtkCell\\n\\nvtkTriangle is a concrete implementation of vtkCell to represent a\\ntriangle located in 3-space.\\n\\n'})" __vtkname__ = 'vtkTriangle'