You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
164 lines
6.8 KiB
C
164 lines
6.8 KiB
C
3 weeks ago
|
/*=========================================================================
|
||
|
|
|
||
|
|
Program: Visualization Toolkit
|
||
|
|
Module: vtkQuadraticPolygon.h
|
||
|
|
|
||
|
|
Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
|
||
|
|
All rights reserved.
|
||
|
|
See Copyright.txt or http://www.kitware.com/Copyright.htm for details.
|
||
|
|
|
||
|
|
This software is distributed WITHOUT ANY WARRANTY; without even
|
||
|
|
the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
|
||
|
|
PURPOSE. See the above copyright notice for more information.
|
||
|
|
|
||
|
|
=========================================================================*/
|
||
|
|
/**
|
||
|
|
* @class vtkQuadraticPolygon
|
||
|
|
* @brief a cell that represents a parabolic n-sided polygon
|
||
|
|
*
|
||
|
|
* vtkQuadraticPolygon is a concrete implementation of vtkNonLinearCell to
|
||
|
|
* represent a 2D n-sided (2*n nodes) parabolic polygon. The polygon cannot
|
||
|
|
* have any internal holes, and cannot self-intersect. The cell includes a
|
||
|
|
* mid-edge node for each of the n edges of the cell. The ordering of the
|
||
|
|
* 2*n points defining the cell are point ids (0..n-1 and n..2*n-1) where ids
|
||
|
|
* 0..n-1 define the corner vertices of the polygon; ids n..2*n-1 define the
|
||
|
|
* midedge nodes. Define the polygon with points ordered in the counter-
|
||
|
|
* clockwise direction; do not repeat the last point.
|
||
|
|
*
|
||
|
|
* @sa
|
||
|
|
* vtkQuadraticEdge vtkQuadraticTriangle vtkQuadraticTetra
|
||
|
|
* vtkQuadraticHexahedron vtkQuadraticWedge vtkQuadraticPyramid
|
||
|
|
*/
|
||
|
|
|
||
|
|
#ifndef vtkQuadraticPolygon_h
|
||
|
|
#define vtkQuadraticPolygon_h
|
||
|
|
|
||
|
|
#include "vtkCommonDataModelModule.h" // For export macro
|
||
|
|
#include "vtkNonLinearCell.h"
|
||
|
|
|
||
|
|
class vtkQuadraticEdge;
|
||
|
|
class vtkPolygon;
|
||
|
|
class vtkIdTypeArray;
|
||
|
|
|
||
|
|
class VTKCOMMONDATAMODEL_EXPORT vtkQuadraticPolygon : public vtkNonLinearCell
|
||
|
|
{
|
||
|
|
public:
|
||
|
|
static vtkQuadraticPolygon *New();
|
||
|
|
vtkTypeMacro(vtkQuadraticPolygon, vtkNonLinearCell);
|
||
|
|
void PrintSelf(ostream& os, vtkIndent indent) VTK_OVERRIDE;
|
||
|
|
|
||
|
|
/**
|
||
|
|
* Implement the vtkCell API. See the vtkCell API for descriptions
|
||
|
|
* of these methods.
|
||
|
|
*/
|
||
|
|
int GetCellType() VTK_OVERRIDE { return VTK_QUADRATIC_POLYGON; }
|
||
|
|
int GetCellDimension() VTK_OVERRIDE { return 2;}
|
||
|
|
int GetNumberOfEdges() VTK_OVERRIDE { return this->GetNumberOfPoints() / 2; }
|
||
|
|
int GetNumberOfFaces() VTK_OVERRIDE { return 0; }
|
||
|
|
vtkCell *GetEdge(int) VTK_OVERRIDE;
|
||
|
|
vtkCell *GetFace(int) VTK_OVERRIDE { return 0; }
|
||
|
|
int IsPrimaryCell() VTK_OVERRIDE { return 0; }
|
||
|
|
|
||
|
|
//@{
|
||
|
|
/**
|
||
|
|
* These methods are based on the vtkPolygon ones :
|
||
|
|
* the vtkQuadraticPolygon (with n edges and 2*n points)
|
||
|
|
* is transform into a vtkPolygon (with 2*n edges and 2*n points)
|
||
|
|
* and the vtkPolygon methods are called.
|
||
|
|
*/
|
||
|
|
int CellBoundary(int subId, double pcoords[3], vtkIdList *pts) VTK_OVERRIDE;
|
||
|
|
void Contour(double value, vtkDataArray *cellScalars,
|
||
|
|
vtkIncrementalPointLocator *locator, vtkCellArray *verts,
|
||
|
|
vtkCellArray *lines, vtkCellArray *polys,
|
||
|
|
vtkPointData *inPd, vtkPointData *outPd,
|
||
|
|
vtkCellData *inCd, vtkIdType cellId, vtkCellData *outCd) VTK_OVERRIDE;
|
||
|
|
void Clip(double value, vtkDataArray *cellScalars,
|
||
|
|
vtkIncrementalPointLocator *locator, vtkCellArray *polys,
|
||
|
|
vtkPointData *inPd, vtkPointData *outPd,
|
||
|
|
vtkCellData *inCd, vtkIdType cellId, vtkCellData *outCd,
|
||
|
|
int insideOut) VTK_OVERRIDE;
|
||
|
|
int EvaluatePosition(double x[3], double* closestPoint,
|
||
|
|
int& subId, double pcoords[3],
|
||
|
|
double& dist2, double *weights) VTK_OVERRIDE;
|
||
|
|
void EvaluateLocation(int& subId, double pcoords[3], double x[3],
|
||
|
|
double *weights) VTK_OVERRIDE;
|
||
|
|
int IntersectWithLine(double p1[3], double p2[3], double tol, double& t,
|
||
|
|
double x[3], double pcoords[3], int& subId) VTK_OVERRIDE;
|
||
|
|
void InterpolateFunctions(double x[3], double *weights) VTK_OVERRIDE;
|
||
|
|
static void ComputeCentroid(vtkIdTypeArray *ids, vtkPoints *pts,
|
||
|
|
double centroid[3]);
|
||
|
|
int ParameterizePolygon(double p0[3], double p10[3], double &l10,
|
||
|
|
double p20[3], double &l20, double n[3]);
|
||
|
|
static int PointInPolygon(double x[3], int numPts, double *pts,
|
||
|
|
double bounds[6], double n[3]);
|
||
|
|
int Triangulate(vtkIdList *outTris);
|
||
|
|
int Triangulate(int index, vtkIdList *ptIds, vtkPoints *pts) VTK_OVERRIDE;
|
||
|
|
int NonDegenerateTriangulate(vtkIdList *outTris);
|
||
|
|
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]);
|
||
|
|
//@}
|
||
|
|
|
||
|
|
// Not implemented
|
||
|
|
void Derivatives(int subId, double pcoords[3], double *values,
|
||
|
|
int dim, double *derivs) VTK_OVERRIDE;
|
||
|
|
|
||
|
|
//@{
|
||
|
|
/**
|
||
|
|
* 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 true by default.
|
||
|
|
*/
|
||
|
|
vtkGetMacro(UseMVCInterpolation, bool);
|
||
|
|
vtkSetMacro(UseMVCInterpolation, bool);
|
||
|
|
//@}
|
||
|
|
|
||
|
|
protected:
|
||
|
|
vtkQuadraticPolygon();
|
||
|
|
~vtkQuadraticPolygon() VTK_OVERRIDE;
|
||
|
|
|
||
|
|
// variables used by instances of this class
|
||
|
|
vtkPolygon *Polygon;
|
||
|
|
vtkQuadraticEdge *Edge;
|
||
|
|
|
||
|
|
// Parameter indicating whether to use Mean Value Coordinate algorithm
|
||
|
|
// for interpolation. The parameter is true by default.
|
||
|
|
bool UseMVCInterpolation;
|
||
|
|
|
||
|
|
//@{
|
||
|
|
/**
|
||
|
|
* Methods to transform a vtkQuadraticPolygon variable into a vtkPolygon
|
||
|
|
* variable.
|
||
|
|
*/
|
||
|
|
static void GetPermutationFromPolygon(vtkIdType nb, vtkIdList *permutation);
|
||
|
|
static void PermuteToPolygon(vtkIdType nbPoints, double *inPoints, double *outPoints);
|
||
|
|
static void PermuteToPolygon(vtkCell *inCell, vtkCell *outCell);
|
||
|
|
static void PermuteToPolygon(vtkPoints *inPoints, vtkPoints *outPoints);
|
||
|
|
static void PermuteToPolygon(vtkIdTypeArray *inIds, vtkIdTypeArray *outIds);
|
||
|
|
static void PermuteToPolygon(vtkDataArray *inDataArray, vtkDataArray *outDataArray);
|
||
|
|
void InitializePolygon();
|
||
|
|
//@}
|
||
|
|
|
||
|
|
//@{
|
||
|
|
/**
|
||
|
|
* Methods to transform a vtkPolygon variable into a vtkQuadraticPolygon
|
||
|
|
* variable.
|
||
|
|
*/
|
||
|
|
static void GetPermutationToPolygon(vtkIdType nb, vtkIdList *permutation);
|
||
|
|
static void PermuteFromPolygon(vtkIdType nb, double *values);
|
||
|
|
static void ConvertFromPolygon(vtkIdList *ids);
|
||
|
|
//@}
|
||
|
|
|
||
|
|
private:
|
||
|
|
vtkQuadraticPolygon(const vtkQuadraticPolygon&) VTK_DELETE_FUNCTION;
|
||
|
|
void operator=(const vtkQuadraticPolygon&) VTK_DELETE_FUNCTION;
|
||
|
|
};
|
||
|
|
|
||
|
|
#endif
|