#include <vtkPolygon.h>
Inheritance diagram for vtkPolygon:
Public Methods | |
virtual const char * | GetClassName () |
virtual int | IsA (const char *type) |
void | ComputeWeights (float x[3], float *weights) |
int | Triangulate (vtkIdList *outTris) |
vtkCell * | MakeObject () |
int | GetCellType () |
int | GetCellDimension () |
int | GetNumberOfEdges () |
int | GetNumberOfFaces () |
vtkCell * | GetEdge (int edgeId) |
vtkCell * | GetFace (int) |
int | CellBoundary (int subId, float pcoords[3], vtkIdList *pts) |
void | Contour (float value, vtkDataArray *cellScalars, vtkPointLocator *locator, vtkCellArray *verts, vtkCellArray *lines, vtkCellArray *polys, vtkPointData *inPd, vtkPointData *outPd, vtkCellData *inCd, vtkIdType cellId, vtkCellData *outCd) |
void | Clip (float value, vtkDataArray *cellScalars, vtkPointLocator *locator, vtkCellArray *tris, vtkPointData *inPd, vtkPointData *outPd, vtkCellData *inCd, vtkIdType cellId, vtkCellData *outCd, int insideOut) |
int | EvaluatePosition (float x[3], float *closestPoint, int &subId, float pcoords[3], float &dist2, float *weights) |
void | EvaluateLocation (int &subId, float pcoords[3], float x[3], float *weights) |
int | IntersectWithLine (float p1[3], float p2[3], float tol, float &t, float x[3], float pcoords[3], int &subId) |
int | Triangulate (int index, vtkIdList *ptIds, vtkPoints *pts) |
void | Derivatives (int subId, float pcoords[3], float *values, int dim, float *derivs) |
int | ParameterizePolygon (float p0[3], float p10[3], float &l10, float p20[3], float &l20, float n[3]) |
Static Public Methods | |
vtkPolygon * | New () |
int | IsTypeOf (const char *type) |
vtkPolygon * | SafeDownCast (vtkObject *o) |
void | ComputeNormal (int numPts, float *pts, float n[3]) |
void | ComputeNormal (vtkPoints *p, int numPts, vtkIdType *pts, float n[3]) |
void | ComputeNormal (vtkPoints *p, float n[3]) |
int | PointInPolygon (float x[3], int numPts, float *pts, float bounds[6], float n[3]) |
int | IntersectPolygonWithPolygon (int npts, float *pts, float bounds[6], int npts2, float *pts2, float bounds2[3], float tol, float x[3]) |
Protected Methods | |
vtkPolygon () | |
~vtkPolygon () | |
int | EarCutTriangulation () |
Protected Attributes | |
float | Tolerance |
int | SuccessfulTriangulation |
float | Normal [3] |
vtkIdList * | Tris |
vtkTriangle * | Triangle |
vtkQuad * | Quad |
vtkFloatArray * | TriScalars |
vtkLine * | Line |
vtkPolygon is a concrete implementation of vtkCell to represent a 2D n-sided polygon. The polygons cannot have any internal holes, and cannot self-intersect.
Definition at line 66 of file vtkPolygon.h.
|
|
|
|
|
Create an object with Debug turned off, modified time initialized to zero, and reference counting on. Reimplemented from vtkObject. |
|
Return the class name as a string. This method is defined in all subclasses of vtkObject with the vtkTypeMacro found in vtkSetGet.h. 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 vtkTypeMacro 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 vtkTypeMacro found in vtkSetGet.h. Reimplemented from vtkCell. |
|
Will cast the supplied object to vtkObject* is this is a safe operation (i.e., a safe downcast); otherwise NULL is returned. This method is defined in all subclasses of vtkObject with the vtkTypeMacro found in vtkSetGet.h. Reimplemented from vtkCell. |
|
See the vtkCell API for descriptions of these methods. Reimplemented from vtkCell. |
|
See the vtkCell API for descriptions of these methods. Reimplemented from vtkCell. Definition at line 75 of file vtkPolygon.h. |
|
See the vtkCell API for descriptions of these methods. Reimplemented from vtkCell. Definition at line 76 of file vtkPolygon.h. |
|
See the vtkCell API for descriptions of these methods. Reimplemented from vtkCell. Definition at line 77 of file vtkPolygon.h. |
|
See the vtkCell API for descriptions of these methods. Reimplemented from vtkCell. Definition at line 78 of file vtkPolygon.h. |
|
See the vtkCell API for descriptions of these methods. Reimplemented from vtkCell. |
|
See the vtkCell API for descriptions of these methods. Reimplemented from vtkCell. Definition at line 80 of file vtkPolygon.h. |
|
See the vtkCell API for descriptions of these methods. Reimplemented from vtkCell. |
|
See the vtkCell API for descriptions of these methods. Reimplemented from vtkCell. |
|
See the vtkCell API for descriptions of these methods. Reimplemented from vtkCell. |
|
See the vtkCell API for descriptions of these methods. Reimplemented from vtkCell. |
|
See the vtkCell API for descriptions of these methods. Reimplemented from vtkCell. |
|
See the vtkCell API for descriptions of these methods. Reimplemented from vtkCell. |
|
See the vtkCell API for descriptions of these methods. Reimplemented from vtkCell. |
|
See the vtkCell API for descriptions of these methods. Reimplemented from vtkCell. |
|
Polygon specific |
|
Polygon specific |
|
Compute the polygon normal from an array of points. This version assumes that the polygon is convex, and looks for the first valid normal. |
|
Compute interpolation weights using 1/r**2 normalized sum. |
|
Create a local s-t coordinate system for a polygon. The point p0 is the origin of the local system, p10 is s-axis vector, and p20 is the t-axis vector. (These are expressed in the modeling coordinate system and are vectors of dimension [3].) The values l20 and l20 are the lengths of the vectors p10 and p20, and n is the polygon normal. |
|
Determine whether point is inside polygon. Function uses ray-casting to determine if point is inside polygon. Works for arbitrary polygon shape (e.g., non-convex). Returns 0 if point is not in polygon; 1 if it is. Can also return -1 to indicate degenerate polygon. |
|
Triangulate this polygon. The user must provide the vtkIdList outTris. On output, the outTris list contains the ids of the points defining the triangulation. The ids are ordered into groups of three: each three-group defines one triangle. |
|
Method intersects two polygons. You must supply the number of points and point coordinates (npts, *pts) and the bounding box (bounds) of the two polygons. Also supply a tolerance squared for controlling error. The method returns 1 if there is an intersection, and 0 if not. A single point of intersection x[3] is also returned if there is an intersection. |
|
A fast triangulation method. Uses recursive divide and conquer based on plane splitting to reduce loop into triangles. The cell (e.g., triangle) is presumed properly initialized (i.e., Points and PointIds). |
|
Definition at line 163 of file vtkPolygon.h. |
|
Definition at line 164 of file vtkPolygon.h. |
|
Definition at line 165 of file vtkPolygon.h. |
|
Definition at line 166 of file vtkPolygon.h. |
|
Definition at line 167 of file vtkPolygon.h. |
|
Definition at line 168 of file vtkPolygon.h. |
|
Definition at line 169 of file vtkPolygon.h. |
|
Definition at line 170 of file vtkPolygon.h. |