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 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616
|
/*=========================================================================
Program: Visualization Toolkit
Module: vtkHigherOrderQuadrilateral.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 "vtkHigherOrderQuadrilateral.h"
#include "vtkCellData.h"
#include "vtkDoubleArray.h"
#include "vtkHigherOrderCurve.h"
#include "vtkHigherOrderInterpolation.h"
#include "vtkIdList.h"
#include "vtkMath.h"
#include "vtkObjectFactory.h"
#include "vtkPointData.h"
#include "vtkPoints.h"
#include "vtkQuad.h"
#include "vtkTriangle.h"
#include "vtkVector.h"
#include "vtkVectorOperators.h"
vtkHigherOrderQuadrilateral::vtkHigherOrderQuadrilateral()
{
this->Approx = nullptr;
this->Order[0] = this->Order[1] = 1;
// Deliberately leave this unset. When GetOrder() is called, it will construct
// the accompanying data arrays used for other calculations.
this->Order[2] = 0;
this->Points->SetNumberOfPoints(4);
this->PointIds->SetNumberOfIds(4);
for (vtkIdType i = 0; i < 4; i++)
{
this->Points->SetPoint(i, 0.0, 0.0, 0.0);
this->PointIds->SetId(i, -1);
}
}
vtkHigherOrderQuadrilateral::~vtkHigherOrderQuadrilateral() = default;
void vtkHigherOrderQuadrilateral::PrintSelf(ostream& os, vtkIndent indent)
{
this->Superclass::PrintSelf(os, indent);
os << indent << "Order: " << this->GetOrder(0) << "\n";
if (this->PointParametricCoordinates)
{
os << indent
<< "PointParametricCoordinates: " << this->PointParametricCoordinates->GetNumberOfPoints()
<< " entries\n";
}
os << indent << "Approx: " << this->Approx << "\n";
}
void vtkHigherOrderQuadrilateral::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)
{
const int* order = this->GetOrder();
// Note in calls below: quad has same edges as first 4 of hex
int oi = vtkHigherOrderInterpolation::GetVaryingParameterOfHexEdge(edgeId);
vtkVector2i eidx = vtkHigherOrderInterpolation::GetPointIndicesBoundingHexEdge(edgeId);
vtkIdType npts = order[oi] + 1;
int sn = 0;
set_number_of_ids_and_points(npts);
for (int i = 0; i < 2; ++i, ++sn)
{
set_ids_and_points(sn, eidx[i]);
}
// Now add edge-interior points in axis order:
int offset = 4;
for (int ee = 0; ee < edgeId; ++ee)
{
offset += order[ee % 2 == 0 ? 0 : 1] - 1;
}
for (int jj = 0; jj < order[oi] - 1; ++jj, ++sn)
{
set_ids_and_points(sn, offset + jj);
}
}
void vtkHigherOrderQuadrilateral::Initialize() {}
int vtkHigherOrderQuadrilateral::CellBoundary(
int vtkNotUsed(subId), const double pcoords[3], vtkIdList* pts)
{
double t1 = pcoords[0] - pcoords[1];
double t2 = 1.0 - pcoords[0] - pcoords[1];
pts->SetNumberOfIds(2);
// compare against two lines in parametric space that divide element
// into four pieces.
if (t1 >= 0.0 && t2 >= 0.0)
{
pts->SetId(0, this->PointIds->GetId(0));
pts->SetId(1, this->PointIds->GetId(1));
}
else if (t1 >= 0.0 && t2 < 0.0)
{
pts->SetId(0, this->PointIds->GetId(1));
pts->SetId(1, this->PointIds->GetId(2));
}
else if (t1 < 0.0 && t2 < 0.0)
{
pts->SetId(0, this->PointIds->GetId(2));
pts->SetId(1, this->PointIds->GetId(3));
}
else //( t1 < 0.0 && t2 >= 0.0 )
{
pts->SetId(0, this->PointIds->GetId(3));
pts->SetId(1, this->PointIds->GetId(0));
}
if (pcoords[0] < 0.0 || pcoords[0] > 1.0 || pcoords[1] < 0.0 || pcoords[1] > 1.0)
{
return 0;
}
else
{
return 1;
}
}
int vtkHigherOrderQuadrilateral::EvaluatePosition(const double x[3], double closestPoint[3],
int& subId, double pcoords[3], double& minDist2, double weights[])
{
int result = 0;
int dummySubId;
double linearWeights[4];
double tmpDist2;
vtkVector3d params;
vtkVector3d tmpClosestPt;
minDist2 = VTK_DOUBLE_MAX;
vtkIdType nquad = vtkHigherOrderInterpolation::NumberOfIntervals<2>(this->GetOrder());
for (int subCell = 0; subCell < nquad; ++subCell)
{
vtkQuad* approx = this->GetApproximateQuad(subCell, nullptr, nullptr);
int stat = approx->EvaluatePosition(
x, tmpClosestPt.GetData(), dummySubId, params.GetData(), tmpDist2, linearWeights);
if (stat != -1 && tmpDist2 < minDist2)
{
result = stat;
subId = subCell;
minDist2 = tmpDist2;
for (int ii = 0; ii < 3; ++ii)
{
pcoords[ii] = params[ii]; // We will translate the winning parameter values later.
if (closestPoint)
{
closestPoint[ii] = tmpClosestPt[ii];
}
}
}
}
if (result != -1)
{
this->TransformApproxToCellParams(subId, pcoords);
if (closestPoint)
{
this->EvaluateLocation(dummySubId, pcoords, closestPoint, weights);
}
else
{
this->InterpolateFunctions(pcoords, weights);
}
}
return result;
}
void vtkHigherOrderQuadrilateral::EvaluateLocation(
int& subId, const double pcoords[3], double x[3], double* weights)
{
subId = 0; // TODO: Should this be -1?
this->InterpolateFunctions(pcoords, weights);
double p[3];
x[0] = x[1] = x[2] = 0.;
vtkIdType nPoints = this->GetPoints()->GetNumberOfPoints();
for (vtkIdType idx = 0; idx < nPoints; ++idx)
{
this->Points->GetPoint(idx, p);
for (vtkIdType jdx = 0; jdx < 3; ++jdx)
{
x[jdx] += p[jdx] * weights[idx];
}
}
}
void vtkHigherOrderQuadrilateral::Contour(double value, vtkDataArray* cellScalars,
vtkIncrementalPointLocator* locator, vtkCellArray* verts, vtkCellArray* lines,
vtkCellArray* polys, vtkPointData* inPd, vtkPointData* outPd, vtkCellData* inCd, vtkIdType cellId,
vtkCellData* outCd)
{
this->PrepareApproxData(
inPd, inCd, cellId, cellScalars); // writes to this->{CellScalars, ApproxPD, ApproxCD}
vtkIdType nquad = vtkHigherOrderInterpolation::NumberOfIntervals<2>(this->GetOrder());
for (int i = 0; i < nquad; ++i)
{
vtkQuad* approx =
this->GetApproximateQuad(i, this->CellScalars.GetPointer(), this->Scalars.GetPointer());
approx->Contour(value, this->Scalars.GetPointer(), locator, verts, lines, polys, this->ApproxPD,
outPd, this->ApproxCD, cellId, outCd);
}
}
void vtkHigherOrderQuadrilateral::Clip(double value, vtkDataArray* cellScalars,
vtkIncrementalPointLocator* locator, vtkCellArray* polys, vtkPointData* inPd, vtkPointData* outPd,
vtkCellData* inCd, vtkIdType cellId, vtkCellData* outCd, int insideOut)
{
this->PrepareApproxData(
inPd, inCd, cellId, cellScalars); // writes to this->{CellScalars, ApproxPD, ApproxCD}
vtkIdType nquad = vtkHigherOrderInterpolation::NumberOfIntervals<2>(this->GetOrder());
for (int i = 0; i < nquad; ++i)
{
vtkQuad* approx =
this->GetApproximateQuad(i, this->CellScalars.GetPointer(), this->Scalars.GetPointer());
approx->Clip(value, this->Scalars.GetPointer(), locator, polys, this->ApproxPD, outPd,
this->ApproxCD, cellId, outCd, insideOut);
}
}
int vtkHigherOrderQuadrilateral::IntersectWithLine(
const double* p1, const double* p2, double tol, double& t, double* x, double* pcoords, int& subId)
{
vtkIdType nquad = vtkHigherOrderInterpolation::NumberOfIntervals<2>(this->GetOrder());
double tFirst = VTK_DOUBLE_MAX;
bool intersection = false;
vtkVector3d tmpX;
vtkVector3d tmpP;
int tmpId;
for (int i = 0; i < nquad; ++i)
{
vtkQuad* approx = this->GetApproximateQuad(i);
if (approx->IntersectWithLine(p1, p2, tol, t, tmpX.GetData(), tmpP.GetData(), tmpId))
{
// Record the point closest to p1 in the direction of p2 unless there is no other
// intersection, in which case we will report a point "before" p1 (further from p2 than p1).
if (!intersection || (t >= 0 && (t < tFirst || tFirst < 0)))
{
tFirst = t;
subId = i;
for (int ii = 0; ii < 3; ++ii)
{
x[ii] = tmpX[ii];
pcoords[ii] = tmpP[ii]; // Translate this after we're sure it's the closest hit.
}
}
intersection = true;
}
}
if (intersection)
{
intersection &= this->TransformApproxToCellParams(subId, pcoords);
t = tFirst;
}
return intersection ? 1 : 0;
}
int vtkHigherOrderQuadrilateral::Triangulate(
int vtkNotUsed(index), vtkIdList* ptIds, vtkPoints* pts)
{
ptIds->Reset();
pts->Reset();
vtkIdType nquad = vtkHigherOrderInterpolation::NumberOfIntervals<2>(this->GetOrder());
for (int i = 0; i < nquad; ++i)
{
vtkQuad* approx = this->GetApproximateQuad(i);
if (approx->Triangulate(1, this->TmpIds.GetPointer(), this->TmpPts.GetPointer()))
{
// Sigh. Triangulate methods all reset their points/ids
// so we must copy them to our output.
vtkIdType np = this->TmpPts->GetNumberOfPoints();
vtkIdType ni = this->TmpIds->GetNumberOfIds();
for (vtkIdType ii = 0; ii < np; ++ii)
{
pts->InsertNextPoint(this->TmpPts->GetPoint(ii));
}
for (vtkIdType ii = 0; ii < ni; ++ii)
{
ptIds->InsertNextId(this->TmpIds->GetId(ii));
}
}
}
return 1;
}
void vtkHigherOrderQuadrilateral::Derivatives(
int vtkNotUsed(subId), const double pcoords[3], const double* values, int dim, double* derivs)
{
vtkIdType numberOfPoints = this->Points->GetNumberOfPoints();
double sum[2], p[3];
std::vector<double> functionDerivs(2 * numberOfPoints);
double *J[3], J0[3], J1[3], J2[3];
double *JI[3], JI0[3], JI1[3], JI2[3];
this->InterpolateDerivs(pcoords, functionDerivs.data());
// Compute transposed Jacobian and inverse Jacobian
J[0] = J0;
J[1] = J1;
J[2] = J2;
JI[0] = JI0;
JI[1] = JI1;
JI[2] = JI2;
for (int k = 0; k < 3; k++)
{
J0[k] = J1[k] = 0.0;
}
for (int i = 0; i < numberOfPoints; i++)
{
this->Points->GetPoint(i, p);
for (int j = 0; j < 2; j++)
{
for (int k = 0; k < 3; k++)
{
J[j][k] += p[k] * functionDerivs[j + 2 * i];
}
}
}
// Compute third row vector in transposed Jacobian and normalize it, so that Jacobian determinant
// stays the same.
vtkMath::Cross(J0, J1, J2);
if (vtkMath::Normalize(J2) == 0.0 || !vtkMath::InvertMatrix(J, JI, 3)) // degenerate
{
for (int j = 0; j < dim; j++)
{
for (int i = 0; i < 3; i++)
{
derivs[j * dim + i] = 0.0;
}
}
return;
}
// Loop over "dim" derivative values. For each set of values,
// compute derivatives
// in local system and then transform into modelling system.
// First compute derivatives in local x'-y' coordinate system
for (int j = 0; j < dim; j++)
{
sum[0] = sum[1] = 0.0;
for (int i = 0; i < numberOfPoints; i++) // loop over interp. function derivatives
{
sum[0] += functionDerivs[2 * i] * values[dim * i + j];
sum[1] += functionDerivs[2 * i + 1] * values[dim * i + j];
}
// dBydx = sum[0]*JI[0][0] + sum[1]*JI[0][1];
// dBydy = sum[0]*JI[1][0] + sum[1]*JI[1][1];
// Transform into global system (dot product with global axes)
derivs[3 * j] = sum[0] * JI[0][0] + sum[1] * JI[0][1];
derivs[3 * j + 1] = sum[0] * JI[1][0] + sum[1] * JI[1][1];
derivs[3 * j + 2] = sum[0] * JI[2][0] + sum[1] * JI[2][1];
}
}
void vtkHigherOrderQuadrilateral::SetParametricCoords()
{
if (!this->PointParametricCoordinates)
{
this->PointParametricCoordinates = vtkSmartPointer<vtkPoints>::New();
this->PointParametricCoordinates->SetDataTypeToDouble();
}
// Ensure Order is up-to-date and check that current point size matches:
if (static_cast<int>(this->PointParametricCoordinates->GetNumberOfPoints()) != this->GetOrder(2))
{
this->PointParametricCoordinates->Initialize();
vtkHigherOrderInterpolation::AppendQuadrilateralCollocationPoints(
this->PointParametricCoordinates, this->Order);
}
}
double* vtkHigherOrderQuadrilateral::GetParametricCoords()
{
this->SetParametricCoords();
return vtkDoubleArray::SafeDownCast(this->PointParametricCoordinates->GetData())->GetPointer(0);
}
double vtkHigherOrderQuadrilateral::GetParametricDistance(const double pcoords[3])
{
double pDist, pDistMax = 0.0;
for (int ii = 0; ii < 2; ++ii)
{
pDist = (pcoords[ii] < 0. ? -pcoords[ii] : (pcoords[ii] > 1. ? pcoords[ii] - 1. : 0.));
if (pDist > pDistMax)
{
pDistMax = pDist;
}
}
// The quadrilateral's 3rd parametric coordinate should always be 0:
if (pcoords[2] != 0.0 && (pDist = std::abs(pcoords[2])) > pDistMax)
{
pDistMax = pDist;
}
return pDistMax;
}
/// Return a linear quadrilateral used to approximate a region of the nonlinear quadrilateral.
vtkQuad* vtkHigherOrderQuadrilateral::GetApprox()
{
if (!this->Approx)
{
this->Approx = vtkSmartPointer<vtkQuad>::New();
this->ApproxPD = vtkSmartPointer<vtkPointData>::New();
this->ApproxCD = vtkSmartPointer<vtkCellData>::New();
}
return this->Approx.GetPointer();
}
/**\brief Prepare point data for use by linear approximating-elements.
*
* This copies the point data for the current cell into a new point-data
* object so that the point ids and scalar ids can match.
*/
void vtkHigherOrderQuadrilateral::PrepareApproxData(
vtkPointData* pd, vtkCellData* cd, vtkIdType cellId, vtkDataArray* cellScalars)
{
this->GetApprox(); // Ensure this->Approx{PD,CD} are non-NULL.
// this->GetOrder(); // Ensure the order has been updated to match this element.
this->SetOrderFromCellData(cd, this->Points->GetNumberOfPoints(), cellId);
vtkIdType npts = this->Order[2];
vtkIdType nele = this->Order[0] * this->Order[1];
this->ApproxPD->Initialize();
this->ApproxCD->Initialize();
this->ApproxPD->CopyAllOn();
this->ApproxCD->CopyAllOn();
this->ApproxPD->CopyAllocate(pd, npts);
this->ApproxCD->CopyAllocate(cd, nele);
this->CellScalars->SetNumberOfTuples(npts);
for (int pp = 0; pp < npts; ++pp)
{
this->ApproxPD->CopyData(pd, this->PointIds->GetId(pp), pp);
this->CellScalars->SetValue(pp, cellScalars->GetTuple1(pp));
}
for (int ee = 0; ee < nele; ++ee)
{
this->ApproxCD->CopyData(cd, cellId, ee);
}
}
/// A convenience method; see the overloaded variant for more information.
bool vtkHigherOrderQuadrilateral::SubCellCoordinatesFromId(vtkVector3i& ijk, int subId)
{
return this->SubCellCoordinatesFromId(ijk[0], ijk[1], ijk[2], subId);
}
/**\brief Given an integer specifying an approximating linear quad, compute its IJK
* coordinate-position in this cell.
*
* The \a subId specifies the lower-, left-, front-most vertex of the approximating quad.
* This sets the ijk coordinates of that point.
*
* You must have called this->GetOrder() **before** invoking this method so that the order will be
* up to date.
*/
bool vtkHigherOrderQuadrilateral::SubCellCoordinatesFromId(int& i, int& j, int& k, int subId)
{
if (subId < 0)
{
return false;
}
i = subId % this->Order[0];
j = (subId / this->Order[0]) % this->Order[1];
k = 0;
return i + this->Order[0] * j == subId ? true : false;
}
/**\brief A convenience function to get a connectivity offset from a control-point tuple.
*
* Ensure that you have called GetOrder() before calling this method
* so that this->Order is up to date. This method does no checking
* before using it to map connectivity-array offsets.
*/
int vtkHigherOrderQuadrilateral::PointIndexFromIJK(int i, int j, int vtkNotUsed(k))
{
return vtkHigherOrderQuadrilateral::PointIndexFromIJK(i, j, this->Order);
}
/**\brief Given (i,j,k) coordinates within the HigherOrder quad, return an offset into the local
* connectivity (PointIds) array.
*
* The \a order parameter must point to the start of an array of 2 integers.
*/
int vtkHigherOrderQuadrilateral::PointIndexFromIJK(int i, int j, const int* order)
{
bool ibdy = (i == 0 || i == order[0]);
bool jbdy = (j == 0 || j == order[1]);
// How many boundaries do we lie on at once?
int nbdy = (ibdy ? 1 : 0) + (jbdy ? 1 : 0);
if (nbdy == 2) // Vertex DOF
{ // ijk is a corner node. Return the proper index (somewhere in [0,7]):
return (i ? (j ? 2 : 1) : (j ? 3 : 0));
}
int offset = 4;
if (nbdy == 1) // Edge DOF
{
if (!ibdy)
{ // On i axis
return (i - 1) + (j ? order[0] - 1 + order[1] - 1 : 0) + offset;
}
if (!jbdy)
{ // On j axis
return (j - 1) + (i ? order[0] - 1 : 2 * (order[0] - 1) + order[1] - 1) + offset;
}
}
offset += 2 * (order[0] - 1 + order[1] - 1);
// nbdy == 0: Face DOF
return offset + (i - 1) + (order[0] - 1) * ((j - 1));
}
/**\brief Given the index, \a subCell, of a linear approximating-quad, translate pcoords from that
* quad into this nonlinear quad.
*
* You must call this->GetOrder() **before** invoking this method as it assumes
* the order is up to date.
*/
bool vtkHigherOrderQuadrilateral::TransformApproxToCellParams(int subCell, double* pcoords)
{
vtkVector3i ijk;
if (!this->SubCellCoordinatesFromId(ijk, subCell))
{
return false;
}
for (int pp = 0; pp < 2; ++pp)
{
pcoords[pp] = (pcoords[pp] + ijk[pp]) / this->Order[pp];
}
pcoords[2] = 0.;
return true;
}
/**\brief Set the degree of the cell, given a vtkDataSet and cellId
*/
void vtkHigherOrderQuadrilateral::SetOrderFromCellData(
vtkCellData* cell_data, const vtkIdType numPts, const vtkIdType cell_id)
{
if (cell_data->SetActiveAttribute(
"HigherOrderDegrees", vtkDataSetAttributes::AttributeTypes::HIGHERORDERDEGREES) != -1)
{
double degs[3];
vtkDataArray* v = cell_data->GetHigherOrderDegrees();
v->GetTuple(cell_id, degs);
this->SetOrder(degs[0], degs[1]);
if (this->Order[2] != numPts)
vtkErrorMacro("The degrees are not correctly set in the input file.");
}
else
{
this->SetUniformOrderFromNumPoints(numPts);
}
}
void vtkHigherOrderQuadrilateral::SetUniformOrderFromNumPoints(const vtkIdType numPts)
{
int deg = static_cast<int>(round(std::sqrt(static_cast<int>(numPts)))) - 1;
this->SetOrder(deg, deg);
if (static_cast<int>(numPts) != this->Order[2])
vtkErrorMacro("The degrees are direction dependents, and should be set in the input file.");
}
void vtkHigherOrderQuadrilateral::SetOrder(const int s, const int t)
{
if (this->PointParametricCoordinates && (Order[0] != s || Order[1] != t))
this->PointParametricCoordinates->Reset();
Order[0] = s;
Order[1] = t;
Order[2] = (s + 1) * (t + 1);
}
const int* vtkHigherOrderQuadrilateral::GetOrder()
{
// The interpolation routines can handle different order along each axis
// The connectivity array contains three additional entries at the end which specify the Order
// in s, t, and u The unstructure grid calls SetOrder with those three additional entries
vtkIdType numPts = this->Points->GetNumberOfPoints();
if (this->Order[2] != numPts)
{
if (numPts == 4)
this->SetUniformOrderFromNumPoints(numPts);
else
vtkErrorMacro("The degrees might be direction dependents, and should be set before GetOrder "
"is called. numPts is "
<< numPts << " and Order[2] " << Order[2]);
}
return this->Order;
}
|