a cell that represents an n-sided polygon More...

#include <vtkPolygon.h>

Inheritance diagram for vtkPolygon:

Collaboration diagram for vtkPolygon:

Public Types
typedef vtkCell	Superclass

Public Types inherited from vtkCell
typedef vtkObject	Superclass

Public Types inherited from vtkObject
typedef vtkObjectBase	Superclass

Public Member Functions
virtual int	IsA (const char *type)

vtkPolygon *	NewInstance () const

void	PrintSelf (ostream &os, vtkIndent indent)

int	GetCellType ()

int	GetCellDimension ()

int	GetNumberOfEdges ()

int	GetNumberOfFaces ()

vtkCell *	GetEdge (int edgeId)

vtkCell *	GetFace (int)

int	CellBoundary (int subId, double pcoords[3], vtkIdList *pts)

void	Contour (double value, vtkDataArray cellScalars, vtkIncrementalPointLocator locator, vtkCellArray verts, vtkCellArray lines, vtkCellArray polys, vtkPointData inPd, vtkPointData outPd, vtkCellData inCd, vtkIdType cellId, vtkCellData *outCd)

void	Clip (double value, vtkDataArray cellScalars, vtkIncrementalPointLocator locator, vtkCellArray tris, vtkPointData inPd, vtkPointData outPd, vtkCellData inCd, vtkIdType cellId, vtkCellData *outCd, int insideOut)

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	IntersectWithLine (double p1[3], double p2[3], double tol, double &t, double x[3], double pcoords[3], int &subId)

int	Triangulate (int index, vtkIdList ptIds, vtkPoints pts)

void	Derivatives (int subId, double pcoords[3], double values, int dim, double derivs)

int	IsPrimaryCell ()

double	ComputeArea ()

virtual void	InterpolateFunctions (double x[3], double *sf)

int	ParameterizePolygon (double p0[3], double p10[3], double &l10, double p20[3], double &l20, double n[3])

int	Triangulate (vtkIdList *outTris)

int	NonDegenerateTriangulate (vtkIdList *outTris)

virtual bool	GetUseMVCInterpolation ()

virtual void	SetUseMVCInterpolation (bool)

Public Member Functions inherited from vtkCell
vtkCell *	NewInstance () const

void	Initialize (int npts, vtkIdType pts, vtkPoints p)

virtual void	ShallowCopy (vtkCell *c)

virtual void	DeepCopy (vtkCell *c)

virtual int	IsLinear ()

virtual int	RequiresInitialization ()

virtual void	Initialize ()

virtual int	IsExplicitCell ()

virtual int	RequiresExplicitFaceRepresentation ()

virtual void	SetFaces (vtkIdType *vtkNotUsed(faces))

virtual vtkIdType *	GetFaces ()

vtkPoints *	GetPoints ()

vtkIdType	GetNumberOfPoints ()

vtkIdList *	GetPointIds ()

vtkIdType	GetPointId (int ptId)

void	GetBounds (double bounds[6])

double *	GetBounds ()

double	GetLength2 ()

virtual int	GetParametricCenter (double pcoords[3])

virtual double	GetParametricDistance (double pcoords[3])

virtual double *	GetParametricCoords ()

virtual void	InterpolateFunctions (double vtkNotUsed(pcoords)[3], double *vtkNotUsed(weight))

virtual void	InterpolateDerivs (double vtkNotUsed(pcoords)[3], double *vtkNotUsed(derivs))

Public Member Functions inherited from vtkObject
vtkObject *	NewInstance () const

virtual void	DebugOn ()

virtual void	DebugOff ()

bool	GetDebug ()

void	SetDebug (bool debugFlag)

virtual void	Modified ()

virtual unsigned long	GetMTime ()

unsigned long	AddObserver (unsigned long event, vtkCommand *, float priority=0.0f)

unsigned long	AddObserver (const char event, vtkCommand , float priority=0.0f)

vtkCommand *	GetCommand (unsigned long tag)

void	RemoveObserver (vtkCommand *)

void	RemoveObservers (unsigned long event, vtkCommand *)

void	RemoveObservers (const char event, vtkCommand )

int	HasObserver (unsigned long event, vtkCommand *)

int	HasObserver (const char event, vtkCommand )

void	RemoveObserver (unsigned long tag)

void	RemoveObservers (unsigned long event)

void	RemoveObservers (const char *event)

void	RemoveAllObservers ()

int	HasObserver (unsigned long event)

int	HasObserver (const char *event)

template<class U , class T >
unsigned long	AddObserver (unsigned long event, U observer, void(T::*callback)(), float priority=0.0f)

template<class U , class T >
unsigned long	AddObserver (unsigned long event, U observer, void(T::callback)(vtkObject , unsigned long, void *), float priority=0.0f)

template<class U , class T >
unsigned long	AddObserver (unsigned long event, U observer, bool(T::callback)(vtkObject , unsigned long, void *), float priority=0.0f)

int	InvokeEvent (unsigned long event, void *callData)

int	InvokeEvent (const char event, void callData)

int	InvokeEvent (unsigned long event)

int	InvokeEvent (const char *event)

Public Member Functions inherited from vtkObjectBase
const char *	GetClassName () const

virtual void	Delete ()

virtual void	FastDelete ()

void	Print (ostream &os)

virtual void	PrintHeader (ostream &os, vtkIndent indent)

virtual void	PrintTrailer (ostream &os, vtkIndent indent)

virtual void	Register (vtkObjectBase *o)

virtual void	UnRegister (vtkObjectBase *o)

int	GetReferenceCount ()

void	SetReferenceCount (int)

void	PrintRevisions (ostream &)

Static Public Member Functions
static vtkPolygon *	New ()

static int	IsTypeOf (const char *type)

static vtkPolygon *	SafeDownCast (vtkObjectBase *o)

static void	ComputeNormal (vtkPoints p, int numPts, vtkIdType pts, double n[3])

static void	ComputeNormal (vtkPoints *p, double n[3])

static void	ComputeNormal (vtkIdTypeArray ids, vtkPoints pts, double n[3])

static void	ComputeNormal (int numPts, double *pts, double n[3])

static void	ComputeCentroid (vtkIdTypeArray ids, vtkPoints pts, double centroid[3])

static double	ComputeArea (vtkPoints p, vtkIdType numPts, vtkIdType pts, double normal[3])

static int	PointInPolygon (double x[3], int numPts, double *pts, double bounds[6], double n[3])

static double	DistanceToPolygon (double x[3], int numPts, double *pts, double bounds[6], double closest[3])

static int	IntersectPolygonWithPolygon (int npts, double pts, double bounds[6], int npts2, double pts2, double bounds2[3], double tol, double x[3])

static int	IntersectConvex2DCells (vtkCell cell1, vtkCell cell2, double tol, double p0[3], double p1[3])

Static Public Member Functions inherited from vtkCell
static int	IsTypeOf (const char *type)

static vtkCell *	SafeDownCast (vtkObjectBase *o)

Static Public Member Functions inherited from vtkObject
static int	IsTypeOf (const char *type)

static vtkObject *	SafeDownCast (vtkObjectBase *o)

static vtkObject *	New ()

static void	BreakOnError ()

static void	SetGlobalWarningDisplay (int val)

static void	GlobalWarningDisplayOn ()

static void	GlobalWarningDisplayOff ()

static int	GetGlobalWarningDisplay ()

Static Public Member Functions inherited from vtkObjectBase
static int	IsTypeOf (const char *name)

static vtkObjectBase *	New ()

Protected Member Functions
virtual vtkObjectBase *	NewInstanceInternal () const

	vtkPolygon ()

	~vtkPolygon ()

void	InterpolateFunctionsUsingMVC (double x[3], double *weights)

int	EarCutTriangulation ()

Protected Member Functions inherited from vtkCell
	vtkCell ()

	~vtkCell ()

Protected Member Functions inherited from vtkObject
	vtkObject ()

virtual	~vtkObject ()

virtual void	RegisterInternal (vtkObjectBase *, int check)

virtual void	UnRegisterInternal (vtkObjectBase *, int check)

void	InternalGrabFocus (vtkCommand mouseEvents, vtkCommand keypressEvents=NULL)

void	InternalReleaseFocus ()

Protected Member Functions inherited from vtkObjectBase
	vtkObjectBase ()

virtual	~vtkObjectBase ()

virtual void	CollectRevisions (ostream &)

virtual void	ReportReferences (vtkGarbageCollector *)

	vtkObjectBase (const vtkObjectBase &)

void	operator= (const vtkObjectBase &)

Protected Attributes
double	Tolerance

int	SuccessfulTriangulation

double	Normal [3]

vtkIdList *	Tris

vtkTriangle *	Triangle

vtkQuad *	Quad

vtkDoubleArray *	TriScalars

vtkLine *	Line

bool	UseMVCInterpolation

Protected Attributes inherited from vtkCell
double	Bounds [6]

Protected Attributes inherited from vtkObject
bool	Debug

vtkTimeStamp	MTime

vtkSubjectHelper *	SubjectHelper

Protected Attributes inherited from vtkObjectBase
vtkAtomicInt32	ReferenceCount

vtkWeakPointerBase **	WeakPointers

Additional Inherited Members
Public Attributes inherited from vtkCell
vtkPoints *	Points

vtkIdList *	PointIds

Detailed Description

a cell that represents an n-sided polygon

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. Define the polygon with n-points ordered in the counter- clockwise direction; do not repeat the last point.

Examples:: vtkPolygon (Examples)

Tests:: vtkPolygon (Tests)

Definition at line 44 of file vtkPolygon.h.

Member Typedef Documentation

◆ Superclass

typedef vtkCell vtkPolygon::Superclass

Definition at line 48 of file vtkPolygon.h.

Constructor & Destructor Documentation

◆ vtkPolygon()

vtkPolygon::vtkPolygon ( )

protected

◆ ~vtkPolygon()

vtkPolygon::~vtkPolygon ( )

protected

Member Function Documentation

◆ New()

static vtkPolygon* vtkPolygon::New ( )

static

◆ IsTypeOf()

static int vtkPolygon::IsTypeOf ( const char * type )

static

◆ IsA()

virtual int vtkPolygon::IsA ( const char * name )

virtual

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.

◆ SafeDownCast()

static vtkPolygon* vtkPolygon::SafeDownCast ( vtkObjectBase * o )

static

◆ NewInstanceInternal()

virtual vtkObjectBase* vtkPolygon::NewInstanceInternal ( ) const

protectedvirtual

Reimplemented from vtkCell.

◆ NewInstance()

vtkPolygon* vtkPolygon::NewInstance ( ) const

◆ PrintSelf()

void vtkPolygon::PrintSelf	(	ostream &	os,
		vtkIndent	indent
	)

virtual

Methods invoked by print to print information about the object including superclasses. Typically not called by the user (use Print() instead) but used in the hierarchical print process to combine the output of several classes.

Reimplemented from vtkCell.

◆ GetCellType()

int vtkPolygon::GetCellType ( )

inlinevirtual

See the vtkCell API for descriptions of these methods.

Implements vtkCell.

Definition at line 53 of file vtkPolygon.h.

◆ GetCellDimension()

int vtkPolygon::GetCellDimension ( )

inlinevirtual

Return the topological dimensional of the cell (0,1,2, or 3).

Implements vtkCell.

Definition at line 54 of file vtkPolygon.h.

◆ GetNumberOfEdges()

int vtkPolygon::GetNumberOfEdges ( )

inlinevirtual

Return the number of edges in the cell.

Implements vtkCell.

Definition at line 55 of file vtkPolygon.h.

◆ GetNumberOfFaces()

int vtkPolygon::GetNumberOfFaces ( )

inlinevirtual

Return the number of faces in the cell.

Implements vtkCell.

Definition at line 56 of file vtkPolygon.h.

◆ GetEdge()

vtkCell* vtkPolygon::GetEdge ( int edgeId )

virtual

Return the edge cell from the edgeId of the cell.

Implements vtkCell.

◆ GetFace()

vtkCell* vtkPolygon::GetFace ( int faceId )

inlinevirtual

Return the face cell from the faceId of the cell.

Implements vtkCell.

Definition at line 58 of file vtkPolygon.h.

◆ CellBoundary()

int vtkPolygon::CellBoundary	(	int	subId,
		double	pcoords[3],
		vtkIdList *	pts
	)

virtual

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.

◆ Contour()

void vtkPolygon::Contour	(	double	value,
		vtkDataArray *	cellScalars,
		vtkIncrementalPointLocator *	locator,
		vtkCellArray *	verts,
		vtkCellArray *	lines,
		vtkCellArray *	polys,
		vtkPointData *	inPd,
		vtkPointData *	outPd,
		vtkCellData *	inCd,
		vtkIdType	cellId,
		vtkCellData *	outCd
	)

virtual

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.

◆ Clip()

void vtkPolygon::Clip	(	double	value,
		vtkDataArray *	cellScalars,
		vtkIncrementalPointLocator *	locator,
		vtkCellArray *	connectivity,
		vtkPointData *	inPd,
		vtkPointData *	outPd,
		vtkCellData *	inCd,
		vtkIdType	cellId,
		vtkCellData *	outCd,
		int	insideOut
	)

virtual

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-NULL, 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.)

Implements vtkCell.

◆ EvaluatePosition()

int vtkPolygon::EvaluatePosition	(	double	x[3],
		double *	closestPoint,
		int &	subId,
		double	pcoords[3],
		double &	dist2,
		double *	weights
	)

virtual

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.

Implements vtkCell.

◆ EvaluateLocation()

void vtkPolygon::EvaluateLocation	(	int &	subId,
		double	pcoords[3],
		double	x[3],
		double *	weights
	)

virtual

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.

◆ IntersectWithLine()

int vtkPolygon::IntersectWithLine	(	double	p1[3],
		double	p2[3],
		double	tol,
		double &	t,
		double	x[3],
		double	pcoords[3],
		int &	subId
	)

virtual

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.

Implements vtkCell.

◆ Triangulate() [1/2]

int vtkPolygon::Triangulate	(	int	index,
		vtkIdList *	ptIds,
		vtkPoints *	pts
	)

virtual

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.

Implements vtkCell.

◆ Derivatives()

void vtkPolygon::Derivatives	(	int	subId,
		double	pcoords[3],
		double *	values,
		int	dim,
		double *	derivs
	)

virtual

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.

◆ IsPrimaryCell()

int vtkPolygon::IsPrimaryCell ( )

inlinevirtual

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).

Reimplemented from vtkCell.

Definition at line 80 of file vtkPolygon.h.

◆ ComputeArea() [1/2]

double vtkPolygon::ComputeArea ( )

Compute the area of a polygon. This is a convenience function which simply calls static double ComputeArea(vtkPoints *p, vtkIdType numPts, vtkIdType *pts, double normal[3]); with the appropriate parameters from the instantiated vtkPolygon.

◆ InterpolateFunctions()

virtual void vtkPolygon::InterpolateFunctions	(	double	x[3],
		double *	sf
	)

virtual

Compute the interpolation functions/derivatives. (aka shape functions/derivatives) Two interpolation algorithms are available: 1/r^2 and Mean Value Coordinate. The former is used by default. To use the second algorithm, set UseMVCInterpolation to be true. The function assumes the input point lies on the polygon plane without checking that.

◆ ComputeNormal() [1/4]

static void vtkPolygon::ComputeNormal	(	vtkPoints *	p,
		int	numPts,
		vtkIdType *	pts,
		double	n[3]
	)

static

Polygon specific methods.

◆ ComputeNormal() [2/4]

static void vtkPolygon::ComputeNormal	(	vtkPoints *	p,
		double	n[3]
	)

static

◆ ComputeNormal() [3/4]

static void vtkPolygon::ComputeNormal	(	vtkIdTypeArray *	ids,
		vtkPoints *	pts,
		double	n[3]
	)

static

◆ ComputeNormal() [4/4]

static void vtkPolygon::ComputeNormal	(	int	numPts,
		double *	pts,
		double	n[3]
	)

static

Compute the polygon normal from an array of points. This version assumes that the polygon is convex, and looks for the first valid normal.

◆ ComputeCentroid()

static void vtkPolygon::ComputeCentroid	(	vtkIdTypeArray *	ids,
		vtkPoints *	pts,
		double	centroid[3]
	)

static

Compute the centroid of a set of points.

◆ ComputeArea() [2/2]

static double vtkPolygon::ComputeArea	(	vtkPoints *	p,
		vtkIdType	numPts,
		vtkIdType *	pts,
		double	normal[3]
	)

static

Compute the area of a polygon in 3D. The area is returned, as well as the normal (a side effect of using this method). If you desire to compute the area of a triangle, use vtkTriangleArea which is faster. If you already have a vtkPolygon instantiated, a convenience function, ComputeArea() is provided.

◆ ParameterizePolygon()

int vtkPolygon::ParameterizePolygon	(	double	p0[3],
		double	p10[3],
		double &	l10,
		double	p20[3],
		double &	l20,
		double	n[3]
	)

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.

◆ PointInPolygon()

static int vtkPolygon::PointInPolygon	(	double	x[3],
		int	numPts,
		double *	pts,
		double	bounds[6],
		double	n[3]
	)

static

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() [2/2]

int vtkPolygon::Triangulate ( vtkIdList * outTris )

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.

◆ NonDegenerateTriangulate()

int vtkPolygon::NonDegenerateTriangulate ( vtkIdList * outTris )

Same as Triangulate(vtkIdList *outTris) but with a first pass to split the polygon into non-degenerate polygons.

◆ DistanceToPolygon()

static double vtkPolygon::DistanceToPolygon	(	double	x[3],
		int	numPts,
		double *	pts,
		double	bounds[6],
		double	closest[3]
	)

static

Compute the distance of a point to a polygon. The closest point on the polygon is also returned. The bounds should be provided to accelerate the computation.

◆ IntersectPolygonWithPolygon()

static int vtkPolygon::IntersectPolygonWithPolygon	(	int	npts,
		double *	pts,
		double	bounds[6],
		int	npts2,
		double *	pts2,
		double	bounds2[3],
		double	tol,
		double	x[3]
	)

static

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.

◆ IntersectConvex2DCells()

static int vtkPolygon::IntersectConvex2DCells	(	vtkCell *	cell1,
		vtkCell *	cell2,
		double	tol,
		double	p0[3],
		double	p1[3]
	)

static

Intersect two convex 2D polygons to produce a line segment as output. The return status of the methods indicated no intersection (returns 0); a single point of intersection (returns 1); or a line segment (i.e., two points of intersection, returns 2). The points of intersection are returned in the arrays p0 and p1. If less than two points of intersection are generated then p1 and/or p0 may be indeterminiate. Finally, if the two convex polygons are parallel, then "0" is returned (i.e., no intersection) even if the triangles lie on one another.

◆ GetUseMVCInterpolation()

virtual bool vtkPolygon::GetUseMVCInterpolation ( )

virtual

Set/Get the flag indicating whether to use Mean Value Coordinate for the interpolation. If true, InterpolateFunctions() uses the Mean Value Coordinate to compute weights. Otherwise, the conventional 1/r^2 method is used. The UseMVCInterpolation parameter is set to false by default.

◆ SetUseMVCInterpolation()

virtual void vtkPolygon::SetUseMVCInterpolation ( bool )

virtual

◆ InterpolateFunctionsUsingMVC()

void vtkPolygon::InterpolateFunctionsUsingMVC	(	double	x[3],
		double *	weights
	)

protected

◆ EarCutTriangulation()

int vtkPolygon::EarCutTriangulation ( )

protected

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).

Member Data Documentation

◆ Tolerance

double vtkPolygon::Tolerance

protected

Definition at line 208 of file vtkPolygon.h.

◆ SuccessfulTriangulation

int vtkPolygon::SuccessfulTriangulation

protected

Definition at line 209 of file vtkPolygon.h.

◆ Normal

double vtkPolygon::Normal[3]

protected

Definition at line 210 of file vtkPolygon.h.

◆ Tris

vtkIdList* vtkPolygon::Tris

protected

Definition at line 211 of file vtkPolygon.h.

◆ Triangle

vtkTriangle* vtkPolygon::Triangle

protected

Definition at line 212 of file vtkPolygon.h.

◆ Quad

vtkQuad* vtkPolygon::Quad

protected

Definition at line 213 of file vtkPolygon.h.

◆ TriScalars

vtkDoubleArray* vtkPolygon::TriScalars

protected

Definition at line 214 of file vtkPolygon.h.

◆ Line

vtkLine* vtkPolygon::Line

protected

Definition at line 215 of file vtkPolygon.h.

◆ UseMVCInterpolation

bool vtkPolygon::UseMVCInterpolation

protected

Definition at line 219 of file vtkPolygon.h.

The documentation for this class was generated from the following file:

dox/opt/build/vtk6-6.3.0+dfsg2/Common/DataModel/vtkPolygon.h

Public Types

Public Member Functions

Static Public Member Functions

Protected Member Functions

Protected Attributes

Additional Inherited Members

Detailed Description

Member Typedef Documentation

◆ Superclass

Constructor & Destructor Documentation

◆ vtkPolygon()

◆ ~vtkPolygon()

Member Function Documentation

◆ New()

◆ IsTypeOf()

◆ IsA()

◆ SafeDownCast()

◆ NewInstanceInternal()

◆ NewInstance()

◆ PrintSelf()

◆ GetCellType()

◆ GetCellDimension()

◆ GetNumberOfEdges()

◆ GetNumberOfFaces()

◆ GetEdge()

◆ GetFace()

◆ CellBoundary()

◆ Contour()

◆ Clip()

◆ EvaluatePosition()

◆ EvaluateLocation()

◆ IntersectWithLine()

◆ Triangulate() [1/2]

◆ Derivatives()

◆ IsPrimaryCell()

◆ ComputeArea() [1/2]

◆ InterpolateFunctions()

◆ ComputeNormal() [1/4]

◆ ComputeNormal() [2/4]

◆ ComputeNormal() [3/4]

◆ ComputeNormal() [4/4]

◆ ComputeCentroid()

◆ ComputeArea() [2/2]

◆ ParameterizePolygon()

◆ PointInPolygon()

◆ Triangulate() [2/2]

◆ NonDegenerateTriangulate()

◆ DistanceToPolygon()

◆ IntersectPolygonWithPolygon()

◆ IntersectConvex2DCells()

◆ GetUseMVCInterpolation()

◆ SetUseMVCInterpolation()

◆ InterpolateFunctionsUsingMVC()

◆ EarCutTriangulation()

Member Data Documentation

◆ Tolerance

◆ SuccessfulTriangulation

◆ Normal

◆ Tris

◆ Triangle

◆ Quad

◆ TriScalars

◆ Line

◆ UseMVCInterpolation