VTK  9.1.0
vtkPolygon.h
Go to the documentation of this file.
1/*=========================================================================
2
3 Program: Visualization Toolkit
4 Module: vtkPolygon.h
5
6 Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
7 All rights reserved.
8 See Copyright.txt or http://www.kitware.com/Copyright.htm for details.
9
10 This software is distributed WITHOUT ANY WARRANTY; without even
11 the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
12 PURPOSE. See the above copyright notice for more information.
13
14=========================================================================*/
34#ifndef vtkPolygon_h
35#define vtkPolygon_h
36
37#include "vtkCell.h"
38#include "vtkCommonDataModelModule.h" // For export macro
39
40class vtkDoubleArray;
41class vtkIdTypeArray;
42class vtkLine;
43class vtkPoints;
44class vtkQuad;
45class vtkTriangle;
47
48class VTKCOMMONDATAMODEL_EXPORT vtkPolygon : public vtkCell
49{
50public:
51 static vtkPolygon* New();
52 vtkTypeMacro(vtkPolygon, vtkCell);
53 void PrintSelf(ostream& os, vtkIndent indent) override;
54
56
59 int GetCellType() override { return VTK_POLYGON; }
60 int GetCellDimension() override { return 2; }
61 int GetNumberOfEdges() override { return this->GetNumberOfPoints(); }
62 int GetNumberOfFaces() override { return 0; }
63 vtkCell* GetEdge(int edgeId) override;
64 vtkCell* GetFace(int) override { return nullptr; }
65 int CellBoundary(int subId, const double pcoords[3], vtkIdList* pts) override;
66 void Contour(double value, vtkDataArray* cellScalars, vtkIncrementalPointLocator* locator,
67 vtkCellArray* verts, vtkCellArray* lines, vtkCellArray* polys, vtkPointData* inPd,
68 vtkPointData* outPd, vtkCellData* inCd, vtkIdType cellId, vtkCellData* outCd) override;
69 void Clip(double value, vtkDataArray* cellScalars, vtkIncrementalPointLocator* locator,
70 vtkCellArray* tris, vtkPointData* inPd, vtkPointData* outPd, vtkCellData* inCd,
71 vtkIdType cellId, vtkCellData* outCd, int insideOut) override;
72 int EvaluatePosition(const double x[3], double closestPoint[3], int& subId, double pcoords[3],
73 double& dist2, double weights[]) override;
74 void EvaluateLocation(int& subId, const double pcoords[3], double x[3], double* weights) override;
75 int IntersectWithLine(const double p1[3], const double p2[3], double tol, double& t, double x[3],
76 double pcoords[3], int& subId) override;
77 int Triangulate(int index, vtkIdList* ptIds, vtkPoints* pts) override;
79 int subId, const double pcoords[3], const double* values, int dim, double* derivs) override;
80 int IsPrimaryCell() override { return 0; }
82
89 double ComputeArea();
90
100 void InterpolateFunctions(const double x[3], double* sf) override;
101
103
107 static void ComputeNormal(vtkPoints* p, int numPts, const vtkIdType* pts, double n[3]);
108 static void ComputeNormal(vtkPoints* p, double n[3]);
109 static void ComputeNormal(vtkIdTypeArray* ids, vtkPoints* pts, double n[3]);
111
116 static void ComputeNormal(int numPts, double* pts, double n[3]);
117
124 bool IsConvex();
125
127
131 static bool IsConvex(vtkPoints* p, int numPts, vtkIdType* pts);
132 static bool IsConvex(vtkIdTypeArray* ids, vtkPoints* p);
133 static bool IsConvex(vtkPoints* p);
135
137
141 static bool ComputeCentroid(vtkPoints* p, int numPts, const vtkIdType* pts, double centroid[3]);
142 static bool ComputeCentroid(vtkIdTypeArray* ids, vtkPoints* pts, double centroid[3]);
144
153 static double ComputeArea(vtkPoints* p, vtkIdType numPts, const vtkIdType* pts, double normal[3]);
154
163 double p0[3], double p10[3], double& l10, double p20[3], double& l20, double n[3]);
164
171 static int PointInPolygon(double x[3], int numPts, double* pts, double bounds[6], double n[3]);
172
181 int Triangulate(vtkIdList* outTris);
182
188
196 int BoundedTriangulate(vtkIdList* outTris, double tol);
197
203 static double DistanceToPolygon(
204 double x[3], int numPts, double* pts, double bounds[6], double closest[3]);
205
214 static int IntersectPolygonWithPolygon(int npts, double* pts, double bounds[6], int npts2,
215 double* pts2, double bounds2[3], double tol, double x[3]);
216
229 vtkCell* cell1, vtkCell* cell2, double tol, double p0[3], double p1[3]);
230
232
238 vtkGetMacro(UseMVCInterpolation, bool);
239 vtkSetMacro(UseMVCInterpolation, bool);
241
243
251 vtkSetClampMacro(Tolerance, double, 0.0, 1.0);
252 vtkGetMacro(Tolerance, double);
254
255protected:
257 ~vtkPolygon() override;
258
259 // Compute the interpolation functions using Mean Value Coordinate.
260 void InterpolateFunctionsUsingMVC(const double x[3], double* weights);
261
262 // variables used by instances of this class
263 double Tolerance; // Intersection tolerance set by public API
264 double Tol; // Internal tolerance set by ComputeBounds()
265 void ComputeTolerance(); // Compute the internal tolerance Tol
266
267 int SuccessfulTriangulation; // Stops recursive triangulation if necessary
268 vtkIdList* Tris; // Output triangulation placed here
269
270 // These are used for internal computation.
275
276 // Parameter indicating whether to use Mean Value Coordinate algorithm
277 // for interpolation. The parameter is false by default.
279
280 // Helper methods for triangulation------------------------------
281 // Made public for extenal access
282public:
283 // Ear cut triangulation options. The order in which vertices are
284 // removed are controlled by different measures. Changing this can
285 // make subtle differences in some cases. Historically the
286 // PERIMETER2_TO_AREA_RATIO has been used.
288 {
289 PERIMETER2_TO_AREA_RATIO = 0,
290 DOT_PRODUCT = 1,
291 BEST_QUALITY = 2
292 };
293
295
303 int EarCutTriangulation(int measure = PERIMETER2_TO_AREA_RATIO);
304 int EarCutTriangulation(vtkIdList* outTris, int measure = PERIMETER2_TO_AREA_RATIO);
306
308
315 int UnbiasedEarCutTriangulation(int seed, int measure = PERIMETER2_TO_AREA_RATIO);
317 int seed, vtkIdList* outTris, int measure = PERIMETER2_TO_AREA_RATIO);
319
320private:
321 vtkPolygon(const vtkPolygon&) = delete;
322 void operator=(const vtkPolygon&) = delete;
323};
324
325#endif
object to represent cell connectivity
Definition: vtkCellArray.h:190
represent and manipulate cell attribute data
Definition: vtkCellData.h:42
abstract class to specify cell behavior
Definition: vtkCell.h:67
vtkIdType GetNumberOfPoints() const
Return the number of points in the cell.
Definition: vtkCell.h:147
abstract superclass for arrays of numeric data
Definition: vtkDataArray.h:59
dynamic, self-adjusting array of double
list of point or cell ids
Definition: vtkIdList.h:40
dynamic, self-adjusting array of vtkIdType
Abstract class in support of both point location and point insertion.
a simple class to control print indentation
Definition: vtkIndent.h:43
cell represents a 1D line
Definition: vtkLine.h:40
represent and manipulate point attribute data
Definition: vtkPointData.h:42
represent and manipulate 3D points
Definition: vtkPoints.h:43
a cell that represents an n-sided polygon
Definition: vtkPolygon.h:49
int IsPrimaryCell() override
See the vtkCell API for descriptions of these methods.
Definition: vtkPolygon.h:80
static int PointInPolygon(double x[3], int numPts, double *pts, double bounds[6], double n[3])
Determine whether point is inside polygon.
double ComputeArea()
Compute the area of a polygon.
int GetCellType() override
See the vtkCell API for descriptions of these methods.
Definition: vtkPolygon.h:59
void Clip(double value, vtkDataArray *cellScalars, vtkIncrementalPointLocator *locator, vtkCellArray *tris, vtkPointData *inPd, vtkPointData *outPd, vtkCellData *inCd, vtkIdType cellId, vtkCellData *outCd, int insideOut) override
See the vtkCell API for descriptions of these methods.
vtkTriangle * Triangle
Definition: vtkPolygon.h:271
int CellBoundary(int subId, const double pcoords[3], vtkIdList *pts) override
See the vtkCell API for descriptions of these methods.
static void ComputeNormal(int numPts, double *pts, double n[3])
Compute the polygon normal from an array of points.
int UnbiasedEarCutTriangulation(int seed, int measure=PERIMETER2_TO_AREA_RATIO)
A fast triangulation method.
int GetNumberOfEdges() override
See the vtkCell API for descriptions of these methods.
Definition: vtkPolygon.h:61
static bool IsConvex(vtkPoints *p)
Determine whether or not a polygon is convex.
int Triangulate(int index, vtkIdList *ptIds, vtkPoints *pts) override
See the vtkCell API for descriptions of these methods.
void ComputeTolerance()
bool UseMVCInterpolation
Definition: vtkPolygon.h:278
static void ComputeNormal(vtkPoints *p, double n[3])
Computes the unit normal to the polygon.
double Tolerance
Definition: vtkPolygon.h:263
void InterpolateFunctionsUsingMVC(const double x[3], double *weights)
int GetNumberOfFaces() override
See the vtkCell API for descriptions of these methods.
Definition: vtkPolygon.h:62
int EvaluatePosition(const double x[3], double closestPoint[3], int &subId, double pcoords[3], double &dist2, double weights[]) override
See the vtkCell API for descriptions of these methods.
int Triangulate(vtkIdList *outTris)
Triangulate this polygon.
void PrintSelf(ostream &os, vtkIndent indent) override
Methods invoked by print to print information about the object including superclasses.
int NonDegenerateTriangulate(vtkIdList *outTris)
Same as Triangulate(vtkIdList *outTris) but with a first pass to split the polygon into non-degenerat...
int GetCellDimension() override
See the vtkCell API for descriptions of these methods.
Definition: vtkPolygon.h:60
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.
int SuccessfulTriangulation
Definition: vtkPolygon.h:267
vtkCell * GetEdge(int edgeId) override
See the vtkCell API for descriptions of these methods.
void EvaluateLocation(int &subId, const double pcoords[3], double x[3], double *weights) override
See the vtkCell API for descriptions of these methods.
vtkQuad * Quad
Definition: vtkPolygon.h:272
void Derivatives(int subId, const double pcoords[3], const double *values, int dim, double *derivs) override
See the vtkCell API for descriptions of these methods.
vtkIdList * Tris
Definition: vtkPolygon.h:268
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 Contour(double value, vtkDataArray *cellScalars, vtkIncrementalPointLocator *locator, vtkCellArray *verts, vtkCellArray *lines, vtkCellArray *polys, vtkPointData *inPd, vtkPointData *outPd, vtkCellData *inCd, vtkIdType cellId, vtkCellData *outCd) override
See the vtkCell API for descriptions of these methods.
~vtkPolygon() override
static bool IsConvex(vtkIdTypeArray *ids, vtkPoints *p)
Determine whether or not a polygon is convex.
int IntersectWithLine(const double p1[3], const double p2[3], double tol, double &t, double x[3], double pcoords[3], int &subId) override
See the vtkCell API for descriptions of these methods.
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.
int EarCutTriangulation(vtkIdList *outTris, int measure=PERIMETER2_TO_AREA_RATIO)
A fast triangulation method.
vtkDoubleArray * TriScalars
Definition: vtkPolygon.h:273
static void ComputeNormal(vtkIdTypeArray *ids, vtkPoints *pts, double n[3])
Computes the unit normal to the polygon.
int BoundedTriangulate(vtkIdList *outTris, double tol)
Triangulate polygon and enforce that the ratio of the smallest triangle area to the polygon area is g...
int EarCutTriangulation(int measure=PERIMETER2_TO_AREA_RATIO)
A fast triangulation method.
static bool IsConvex(vtkPoints *p, int numPts, vtkIdType *pts)
Determine whether or not a polygon is convex.
vtkCell * GetFace(int) override
See the vtkCell API for descriptions of these methods.
Definition: vtkPolygon.h:64
static bool ComputeCentroid(vtkPoints *p, int numPts, const vtkIdType *pts, double centroid[3])
Compute the centroid of a set of points.
static double ComputeArea(vtkPoints *p, vtkIdType numPts, const vtkIdType *pts, double normal[3])
Compute the area of a polygon in 3D.
void InterpolateFunctions(const double x[3], double *sf) override
Compute the interpolation functions/derivatives.
bool IsConvex()
Determine whether or not a polygon is convex.
vtkLine * Line
Definition: vtkPolygon.h:274
static bool ComputeCentroid(vtkIdTypeArray *ids, vtkPoints *pts, double centroid[3])
Compute the centroid of a set of points.
int UnbiasedEarCutTriangulation(int seed, vtkIdList *outTris, int measure=PERIMETER2_TO_AREA_RATIO)
A fast triangulation method.
static vtkPolygon * New()
double Tol
Definition: vtkPolygon.h:264
static void ComputeNormal(vtkPoints *p, int numPts, const vtkIdType *pts, double n[3])
Computes the unit normal to the polygon.
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.
a cell that represents a 2D quadrilateral
Definition: vtkQuad.h:45
a cell that represents a triangle
Definition: vtkTriangle.h:45
@ value
Definition: vtkX3D.h:226
@ index
Definition: vtkX3D.h:252
@ VTK_POLYGON
Definition: vtkCellType.h:53
int vtkIdType
Definition: vtkType.h:332