Go to the documentation of this file.
34 #include "vtkCommonDataModelModule.h"
72 int insideOut)
override;
74 int& subId,
double pcoords[3],
75 double& dist2,
double weights[])
override;
77 double *weights)
override;
79 double x[3],
double pcoords[3],
int& subId)
override;
81 void Derivatives(
int subId,
const double pcoords[3],
const double *values,
82 int dim,
double *derivs)
override;
170 double p20[3],
double &l20,
double n[3]);
179 double bounds[6],
double n[3]);
210 double bounds[6],
double closest[3]);
221 int npts2,
double *pts2,
222 double bounds2[3],
double tol,
237 double tol,
double p0[3],
double p1[3]);
246 vtkGetMacro(UseMVCInterpolation,
bool);
247 vtkSetMacro(UseMVCInterpolation,
bool);
represent and manipulate 3D points
static bool IsConvex(vtkPoints *p)
int NonDegenerateTriangulate(vtkIdList *outTris)
Same as Triangulate(vtkIdList *outTris) but with a first pass to split the polygon into non-degenerat...
represent and manipulate point attribute data
int GetNumberOfFaces() override
Return the number of faces in the cell.
double ComputeArea()
Compute the area of a polygon.
vtkCell * GetFace(int) override
Return the face cell from the faceId of the cell.
static bool ComputeCentroid(vtkIdTypeArray *ids, vtkPoints *pts, double centroid[3])
a cell that represents an n-sided polygon
int Triangulate(vtkIdList *outTris)
Triangulate this polygon.
static void ComputeNormal(vtkIdTypeArray *ids, vtkPoints *pts, double n[3])
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.
static int IntersectConvex2DCells(vtkCell *cell1, vtkCell *cell2, double tol, double p0[3], double p1[3])
Intersect two convex 2D polygons to produce a line segment as output.
int BoundedTriangulate(vtkIdList *outTris, double tol)
Triangulate polygon and enforce that the ratio of the smallest triangle area to the polygon area is g...
abstract superclass for arrays of numeric data
static bool IsConvex(vtkPoints *p, int numPts, vtkIdType *pts)
Determine whether or not a polygon is convex.
static double ComputeArea(vtkPoints *p, vtkIdType numPts, vtkIdType *pts, double normal[3])
Compute the area of a polygon in 3D.
int GetCellType() override
See the vtkCell API for descriptions of these methods.
void InterpolateFunctionsUsingMVC(const double x[3], double *weights)
void Clip(double value, vtkDataArray *cellScalars, vtkIncrementalPointLocator *locator, vtkCellArray *tris, vtkPointData *inPd, vtkPointData *outPd, vtkCellData *inCd, vtkIdType cellId, vtkCellData *outCd, int insideOut) override
Cut (or clip) the cell based on the input cellScalars and the specified value.
cell represents a 1D line
static bool IsConvex(vtkIdTypeArray *ids, vtkPoints *p)
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 i...
int SuccessfulTriangulation
int UnbiasedEarCutTriangulation(int seed)
A fast triangulation method.
static bool ComputeCentroid(vtkPoints *p, int numPts, vtkIdType *pts, double centroid[3])
Compute the centroid of a set of points.
int IntersectWithLine(const double p1[3], const double p2[3], double tol, double &t, double x[3], double pcoords[3], int &subId) override
Intersect with a ray.
static void ComputeNormal(vtkPoints *p, int numPts, vtkIdType *pts, double n[3])
Computes the unit normal to the polygon.
abstract class to specify cell behavior
void PrintSelf(ostream &os, vtkIndent indent) override
Methods invoked by print to print information about the object including superclasses.
static int PointInPolygon(double x[3], int numPts, double *pts, double bounds[6], double n[3])
Determine whether point is inside polygon.
represent and manipulate cell attribute data
a simple class to control print indentation
static double DistanceToPolygon(double x[3], int numPts, double *pts, double bounds[6], double closest[3])
Compute the distance of a point to a polygon.
object to represent cell connectivity
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; ev...
Abstract class in support of both point location and point insertion.
list of point or cell ids
vtkDoubleArray * TriScalars
vtkCell * GetEdge(int edgeId) override
Return the edge cell from the edgeId of the cell.
int GetNumberOfEdges() override
Return the number of edges in the cell.
void EvaluateLocation(int &subId, const double pcoords[3], double x[3], double *weights) override
Determine global coordinate (x[3]) from subId and parametric coordinates.
vtkIdType GetNumberOfPoints()
Return the number of points in the cell.
int EarCutTriangulation()
A fast triangulation method.
a cell that represents a triangle
void InterpolateFunctions(const double x[3], double *sf) override
Compute the interpolation functions/derivatives.
int 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.
static int IntersectPolygonWithPolygon(int npts, double *pts, double bounds[6], int npts2, double *pts2, double bounds2[3], double tol, double x[3])
Method intersects two polygons.
void Derivatives(int subId, const double pcoords[3], const double *values, int dim, double *derivs) override
Compute derivatives given cell subId and parametric coordinates.
dynamic, self-adjusting array of vtkIdType
static void ComputeNormal(int numPts, double *pts, double n[3])
Compute the polygon normal from an array of points.
int IsPrimaryCell() override
Return whether this cell type has a fixed topology or whether the topology varies depending on the da...
dynamic, self-adjusting array of double
int GetCellDimension() override
Return the topological dimensional of the cell (0,1,2, or 3).
int Triangulate(int index, vtkIdList *ptIds, vtkPoints *pts) override
Generate simplices of proper dimension.
static vtkPolygon * New()
static void ComputeNormal(vtkPoints *p, double n[3])
a cell that represents a 2D quadrilateral
bool IsConvex()
Determine whether or not a polygon is convex.