1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
|
// SPDX-FileCopyrightText: Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
// SPDX-License-Identifier: BSD-3-Clause
/**
* @class vtkHigherOrderTriangle
* @brief A 2D cell that represents an arbitrary order HigherOrder triangle
*
* vtkHigherOrderTriangle is a concrete implementation of vtkCell to represent a
* 2D triangle using HigherOrder shape functions of user specified order.
*
* The number of points in a HigherOrder cell determines the order over which they
* are iterated relative to the parametric coordinate system of the cell. The
* first points that are reported are vertices. They appear in the same order in
* which they would appear in linear cells. Mid-edge points are reported next.
* They are reported in sequence. For two- and three-dimensional (3D) cells, the
* following set of points to be reported are face points. Finally, 3D cells
* report points interior to their volume.
*/
#ifndef vtkHigherOrderTriangle_h
#define vtkHigherOrderTriangle_h
#include <functional> //For std::function
#include "vtkCommonDataModelModule.h" // For export macro
#include "vtkNew.h" // For member variable.
#include "vtkNonLinearCell.h"
#include "vtkSmartPointer.h" // For member variable.
#include <vector> // For caching
VTK_ABI_NAMESPACE_BEGIN
class vtkDoubleArray;
class vtkHigherOrderCurve;
class vtkTriangle;
class VTKCOMMONDATAMODEL_EXPORT vtkHigherOrderTriangle : public vtkNonLinearCell
{
public:
vtkTypeMacro(vtkHigherOrderTriangle, vtkNonLinearCell);
void PrintSelf(ostream& os, vtkIndent indent) override;
int GetCellType() override = 0;
int GetCellDimension() override { return 2; }
int RequiresInitialization() override { return 1; }
int GetNumberOfEdges() override { return 3; }
int GetNumberOfFaces() override { return 0; }
vtkCell* GetEdge(int edgeId) override = 0;
void SetEdgeIdsAndPoints(int edgeId,
const std::function<void(const vtkIdType&)>& set_number_of_ids_and_points,
const std::function<void(const vtkIdType&, const vtkIdType&)>& set_ids_and_points);
vtkCell* GetFace(int) override { return nullptr; }
void Initialize() override;
int CellBoundary(int subId, const double pcoords[3], vtkIdList* pts) override;
int EvaluatePosition(const double x[3], double closestPoint[3], int& subId, double pcoords[3],
double& dist2, double weights[]) override;
void EvaluateLocation(int& subId, const double pcoords[3], double x[3], double* weights) 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) override;
void Clip(double value, vtkDataArray* cellScalars, vtkIncrementalPointLocator* locator,
vtkCellArray* polys, vtkPointData* inPd, vtkPointData* outPd, vtkCellData* inCd,
vtkIdType cellId, vtkCellData* outCd, int insideOut) override;
int IntersectWithLine(const double p1[3], const double p2[3], double tol, double& t, double x[3],
double pcoords[3], int& subId) override;
int TriangulateLocalIds(int index, vtkIdList* ptIds) override;
void JacobianInverse(const double pcoords[3], double** inverse, double* derivs);
void Derivatives(
int subId, const double pcoords[3], const double* values, int dim, double* derivs) override;
void SetParametricCoords();
double* GetParametricCoords() override;
int GetParametricCenter(double pcoords[3]) override;
double GetParametricDistance(const double pcoords[3]) override;
void InterpolateFunctions(const double pcoords[3], double* weights) override = 0;
void InterpolateDerivs(const double pcoords[3], double* derivs) override = 0;
vtkIdType GetOrder() const { return this->Order; }
vtkIdType ComputeOrder();
/// Return true if the number of points supports a cell of uniform
/// degree along each axis.
static bool PointCountSupportsUniformOrder(vtkIdType pointsPerTri);
void ToBarycentricIndex(vtkIdType index, vtkIdType* bindex);
vtkIdType ToIndex(const vtkIdType* bindex);
static void BarycentricIndex(vtkIdType index, vtkIdType* bindex, vtkIdType order);
static vtkIdType Index(const vtkIdType* bindex, vtkIdType order);
static double Eta(vtkIdType n, vtkIdType chi, double sigma);
static double Deta(vtkIdType n, vtkIdType chi, double sigma);
virtual vtkHigherOrderCurve* GetEdgeCell() = 0;
protected:
vtkHigherOrderTriangle();
~vtkHigherOrderTriangle() override;
vtkIdType GetNumberOfSubtriangles() const { return this->NumberOfSubtriangles; }
vtkIdType ComputeNumberOfSubtriangles();
// Description:
// Given the index of the subtriangle, compute the barycentric indices of
// the subtriangle's vertices.
void SubtriangleBarycentricPointIndices(vtkIdType cellIndex, vtkIdType (&pointBIndices)[3][3]);
vtkTriangle* Face;
vtkDoubleArray* Scalars; // used to avoid New/Delete in contouring/clipping
vtkIdType Order;
vtkIdType NumberOfSubtriangles;
vtkSmartPointer<vtkPoints> PointParametricCoordinates;
std::vector<vtkIdType> BarycentricIndexMap;
std::vector<vtkIdType> IndexMap;
std::vector<vtkIdType> SubtriangleIndexMap;
private:
vtkHigherOrderTriangle(const vtkHigherOrderTriangle&) = delete;
void operator=(const vtkHigherOrderTriangle&) = delete;
};
VTK_ABI_NAMESPACE_END
#endif
|
