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
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
|
/*=========================================================================
Program: Visualization Toolkit
Module: TestHigherOrderCell.cxx
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.
=========================================================================*/
#include "vtkGenericCell.h"
#include "vtkPoints.h"
static const unsigned int depth = 5;
static unsigned char HigherOrderCell[][depth] = {
{ VTK_LINE, VTK_QUADRATIC_EDGE, VTK_NUMBER_OF_CELL_TYPES,
VTK_NUMBER_OF_CELL_TYPES, VTK_NUMBER_OF_CELL_TYPES },
{ VTK_TRIANGLE, VTK_QUADRATIC_TRIANGLE, VTK_BIQUADRATIC_TRIANGLE,
VTK_NUMBER_OF_CELL_TYPES, VTK_NUMBER_OF_CELL_TYPES },
{ VTK_QUAD, VTK_QUADRATIC_QUAD, VTK_QUADRATIC_LINEAR_QUAD,
VTK_BIQUADRATIC_QUAD, VTK_NUMBER_OF_CELL_TYPES},
{ VTK_TETRA, VTK_QUADRATIC_TETRA, VTK_NUMBER_OF_CELL_TYPES,
VTK_NUMBER_OF_CELL_TYPES, VTK_NUMBER_OF_CELL_TYPES },
{ VTK_HEXAHEDRON, VTK_QUADRATIC_HEXAHEDRON,
VTK_BIQUADRATIC_QUADRATIC_HEXAHEDRON, VTK_TRIQUADRATIC_HEXAHEDRON,
VTK_NUMBER_OF_CELL_TYPES },
{ VTK_WEDGE, VTK_QUADRATIC_WEDGE, VTK_QUADRATIC_LINEAR_WEDGE,
VTK_BIQUADRATIC_QUADRATIC_WEDGE, VTK_NUMBER_OF_CELL_TYPES },
{ VTK_PYRAMID, VTK_QUADRATIC_PYRAMID, VTK_NUMBER_OF_CELL_TYPES,
VTK_NUMBER_OF_CELL_TYPES, VTK_NUMBER_OF_CELL_TYPES }
};
//----------------------------------------------------------------------------
// Simply set the points to the pcoords coordinate
// and the point id to the natural order
void InitializeACell(vtkCell *cell)
{
if( cell )
{
double *pcoords = cell->GetParametricCoords();
int numPts = cell->GetNumberOfPoints();
for(int i = 0; i < numPts; ++i)
{
double *point = pcoords + 3*i;
cell->GetPointIds()->SetId(i,i);
//cerr << point[0] << "," << point[1] << "," << point[2] << endl;
cell->GetPoints()->SetPoint(i, point);
}
}
}
//----------------------------------------------------------------------------
// c1 is the reference cell. In the test this is the linear cell
// and thus c2 is the higher order one. We need to check that result on c1
// are consistent with result on c2 (but we cannot say anything after that)
int CompareHigherOrderCell(vtkCell *c1, vtkCell *c2)
{
int rval = 0;
//c1->Print( cout );
//c2->Print( cout );
int c1numPts = c1->GetNumberOfPoints();
int c2numPts = c2->GetNumberOfPoints();
int numPts = c1numPts < c2numPts ? c1numPts : c2numPts;
for( int p = 0; p < numPts; ++p)
{
vtkIdType pid1 = c1->GetPointId(p);
vtkIdType pid2 = c2->GetPointId(p);
if( pid1 != pid2 )
{
cerr << "Problem with pid:" << pid1 << " != " << pid2 << " in cell #" <<
c1->GetCellType() << " and #" << c2->GetCellType() << endl;
++rval;
}
double *pt1 = c1->Points->GetPoint(p);
double *pt2 = c2->Points->GetPoint(p);
if( pt1[0] != pt2[0]
|| pt1[1] != pt2[1]
|| pt1[2] != pt2[2])
{
cerr << "Problem with points coord:" <<
pt1[0] << "," << pt1[1] << "," << pt1[2]
<< " != " <<
pt2[0] << "," << pt2[1] << "," << pt2[2]
<< " in cell #" <<
c1->GetCellType() << " and #" << c2->GetCellType() << endl;
++rval;
}
}
return rval;
}
//----------------------------------------------------------------------------
int TestHigherOrderCell(int , char *[])
{
int rval = 0;
if( sizeof(HigherOrderCell[0]) != depth )
{
cerr << sizeof(HigherOrderCell[0]) << endl;
cerr << "Problem in the test" << endl;
return 1;
}
const unsigned char *orderCell;
const unsigned int nCells = sizeof(HigherOrderCell)/depth;
vtkCell* cellArray[depth];
for( unsigned int i = 0; i < nCells; ++i)
{
orderCell = HigherOrderCell[i];
//cerr << "Higher : " << (int)orderCell[0] << "," << (int)orderCell[1]
// << "," << (int)orderCell[2] << "," << (int)orderCell[3] << ","
// << (int)orderCell[4] << endl;
for( unsigned int c = 0; c < depth; ++c)
{
const int cellType = orderCell[c];
cellArray[c] = vtkGenericCell::InstantiateCell(cellType);
InitializeACell( cellArray[c] );
}
vtkCell *linCell = cellArray[0]; // this is the reference linear cell
vtkCell *quadCell = cellArray[1]; // this is the reference quadratic cell (serendipity)
//const int numPts = linCell->GetNumberOfPoints();
const int numEdges = linCell->GetNumberOfEdges();
const int numFaces = linCell->GetNumberOfFaces();
const int dim = linCell->GetCellDimension();
// First check consistancy across cell of higher dimension:
// Technically doing the loop from 1 to depth will be redundant when doing the
// CompareHigherOrderCell on the quadratic cell since we will compare the exactly
// same cell...
for( unsigned int c = 1; c < depth; ++c)
{
vtkCell *cell = cellArray[c];
if( cell )
{
if( cell->GetCellType() != (int)orderCell[c] )
{
cerr << "Problem in the test" << endl;
++rval;
}
if( cell->GetCellDimension() != dim )
{
cerr << "Wrong dim for cellId #" << cell->GetCellType() << endl;
++rval;
}
if( cell->GetNumberOfEdges() != numEdges)
{
cerr << "Wrong numEdges for cellId #" << cell->GetCellType() << endl;
++rval;
}
if( cell->GetNumberOfFaces() != numFaces )
{
cerr << "Wrong numFace for cellId #" << cell->GetCellType() << endl;
++rval;
}
// Make sure that edge across all different cell are identical
for(int e=0; e<numEdges; ++e)
{
vtkCell *c1 = linCell->GetEdge(e);
vtkCell *c2 = cell->GetEdge(e);
cerr << "Doing Edge: #" << e << " comp:" << linCell->GetCellType() << " vs "
<< cell->GetCellType() << endl;
rval += CompareHigherOrderCell(c1, c2);
vtkCell *qc1 = quadCell->GetEdge(e);
cerr << "Doing Edge: #" << e << " comp:" << quadCell->GetCellType() << " vs "
<< cell->GetCellType() << endl;
if( cell->GetCellType() != VTK_QUADRATIC_LINEAR_QUAD
&& cell->GetCellType() != VTK_QUADRATIC_LINEAR_WEDGE)
{
rval += CompareHigherOrderCell(qc1, c2);
}
}
// Make sure that face across all different cell are identical
for(int f=0; f<numFaces; ++f)
{
vtkCell *f1 = linCell->GetFace(f);
vtkCell *f2 = cell->GetFace(f);
cerr << "Doing Face: #" << f << " comp:" << linCell->GetCellType() << " vs "
<< cell->GetCellType() << endl;
if( cell->GetCellType() != VTK_QUADRATIC_LINEAR_WEDGE)
{
rval += CompareHigherOrderCell(f1, f2);
}
vtkCell *qf1 = quadCell->GetFace(f);
cerr << "Doing Face: #" << f << " comp:" << quadCell->GetCellType() << " vs "
<< cell->GetCellType() << endl;
if( cell->GetCellType() != VTK_QUADRATIC_LINEAR_QUAD
&& cell->GetCellType() != VTK_QUADRATIC_LINEAR_WEDGE)
{
rval += CompareHigherOrderCell(qf1, f2);
}
}
}
}
// Cleanup
for( unsigned int c = 0; c < depth; ++c)
{
vtkCell *cell = cellArray[c];
if( cell )
{
cell->Delete();
}
}
}
return rval;
}
|
