#include <vtkTriangle.h>
Inheritance diagram for vtkTriangle:
vtkTriangle is a concrete implementation of vtkCell to represent a triangle located in 3-space.
Definition at line 38 of file vtkTriangle.h.
Public Types | |
typedef vtkCell | Superclass |
Public Member Functions | |
virtual const char * | GetClassName () |
virtual int | IsA (const char *type) |
vtkCell * | GetEdge (int edgeId) |
int | GetCellType () |
int | GetCellDimension () |
int | GetNumberOfEdges () |
int | GetNumberOfFaces () |
vtkCell * | GetFace (int) |
int | CellBoundary (int subId, double pcoords[3], vtkIdList *pts) |
void | Contour (double value, vtkDataArray *cellScalars, vtkPointLocator *locator, vtkCellArray *verts, vtkCellArray *lines, vtkCellArray *polys, vtkPointData *inPd, vtkPointData *outPd, vtkCellData *inCd, vtkIdType cellId, vtkCellData *outCd) |
int | EvaluatePosition (double x[3], double *closestPoint, int &subId, double pcoords[3], double &dist2, double *weights) |
void | EvaluateLocation (int &subId, double pcoords[3], double x[3], double *weights) |
int | Triangulate (int index, vtkIdList *ptIds, vtkPoints *pts) |
void | Derivatives (int subId, double pcoords[3], double *values, int dim, double *derivs) |
virtual double * | GetParametricCoords () |
void | Clip (double value, vtkDataArray *cellScalars, vtkPointLocator *locator, vtkCellArray *polys, vtkPointData *inPd, vtkPointData *outPd, vtkCellData *inCd, vtkIdType cellId, vtkCellData *outCd, int insideOut) |
int | IntersectWithLine (double p1[3], double p2[3], double tol, double &t, double x[3], double pcoords[3], int &subId) |
int | GetParametricCenter (double pcoords[3]) |
double | GetParametricDistance (double pcoords[3]) |
Static Public Member Functions | |
static vtkTriangle * | New () |
static int | IsTypeOf (const char *type) |
static vtkTriangle * | SafeDownCast (vtkObject *o) |
static void | TriangleCenter (double p1[3], double p2[3], double p3[3], double center[3]) |
static double | TriangleArea (double p1[3], double p2[3], double p3[3]) |
static double | Circumcircle (double p1[2], double p2[2], double p3[2], double center[2]) |
static int | BarycentricCoords (double x[2], double x1[2], double x2[2], double x3[2], double bcoords[3]) |
static int | ProjectTo2D (double x1[3], double x2[3], double x3[3], double v1[2], double v2[2], double v3[2]) |
static void | ComputeNormal (vtkPoints *p, int numPts, vtkIdType *pts, double n[3]) |
static void | ComputeNormal (double v1[3], double v2[3], double v3[3], double n[3]) |
static void | ComputeNormalDirection (double v1[3], double v2[3], double v3[3], double n[3]) |
static int | PointInTriangle (double x[3], double x1[3], double x2[3], double x3[3], double tol2) |
static void | ComputeQuadric (double x1[3], double x2[3], double x3[3], double quadric[4][4]) |
static void | ComputeQuadric (double x1[3], double x2[3], double x3[3], vtkQuadric *quadric) |
Protected Member Functions | |
vtkTriangle () | |
~vtkTriangle () | |
Protected Attributes | |
vtkLine * | Line |
|
Reimplemented from vtkCell. Definition at line 42 of file vtkTriangle.h. |
|
|
|
|
|
Create an object with Debug turned off, modified time initialized to zero, and reference counting on. Reimplemented from vtkObject. |
|
Reimplemented from vtkCell. |
|
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 vtkTypeRevisionMacro found in vtkSetGet.h. Reimplemented from vtkCell. |
|
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 vtkTypeRevisionMacro found in vtkSetGet.h. Reimplemented from vtkCell. |
|
Reimplemented from vtkCell. |
|
Get the edge specified by edgeId (range 0 to 2) and return that edge's coordinates. Implements vtkCell. |
|
See the vtkCell API for descriptions of these methods. Implements vtkCell. Definition at line 53 of file vtkTriangle.h. References VTK_TRIANGLE. |
|
Return the topological dimensional of the cell (0,1,2, or 3). Implements vtkCell. Definition at line 54 of file vtkTriangle.h. |
|
Return the number of edges in the cell. Implements vtkCell. Definition at line 55 of file vtkTriangle.h. |
|
Return the number of faces in the cell. Implements vtkCell. Definition at line 56 of file vtkTriangle.h. |
|
Return the face cell from the faceId of the cell. Implements vtkCell. Definition at line 57 of file vtkTriangle.h. |
|
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. Implements vtkCell. |
|
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 NULL, then no interpolation is performed. Also, if the output cell data is non-NULL, 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.) Implements vtkCell. |
|
Given a point x[3] return inside(=1) or outside(=0) cell; 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. Implements vtkCell. |
|
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.) Implements vtkCell. |
|
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. Implements vtkCell. |
|
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)). Implements vtkCell. |
|
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-NULL 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. Reimplemented from vtkCell. |
|
Clip this triangle using scalar value provided. Like contouring, except that it cuts the triangle to produce other triangles. Implements vtkCell. |
|
Plane intersection plus in/out test on triangle. The in/out test is performed using tol as the tolerance. Implements vtkCell. |
|
Return the center of the triangle in parametric coordinates. Reimplemented from vtkCell. Definition at line 192 of file vtkTriangle.h. |
|
Return the distance of the parametric coordinate provided to the cell. If inside the cell, a distance of zero is returned. Reimplemented from vtkCell. |
|
Compute the center of the triangle. Definition at line 227 of file vtkTriangle.h. |
|
Compute the area of a triangle in 3D. Definition at line 235 of file vtkTriangle.h. References vtkMath::Distance2BetweenPoints(). |
|
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.) |
|
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. |
|
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. |
|
Compute the triangle normal from a points list, and a list of point ids that index into the points list. |
|
Compute the triangle normal from three points. Definition at line 212 of file vtkTriangle.h. References ComputeNormalDirection(). |
|
Compute the (unnormalized) triangle normal direction from three points. Definition at line 198 of file vtkTriangle.h. Referenced by ComputeNormal(). |
|
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. |
|
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") |
|
|
|
Definition at line 185 of file vtkTriangle.h. |