【VTK】最近点计算

  vtkIdList* ids = vtkIdList::New();
  int j;
  int n;
  double dist2;
  int subId;

  strm << "Test vtkCell::EvaluatePosition Start" << endl;

  // Vertex
  vtkVertex* vertex = vtkVertex::New();
  double vertexCoords[3], vertexWeights[2];
  double vertexPoint[2][3] = { { 10.0, 20.0, 30.0 }, { 0, 0, 0 } };
  double vertexClosest[3];

  vertex->GetPointIds()->SetId(0, 0);
  vertex->GetPoints()->SetPoint(0, 10.0, 20.0, 30.0);

  n = sizeof(vertexPoint) / (3 * sizeof(double));
  for (j = 0; j < n; j++)
  {
    vertex->EvaluatePosition(
      &vertexPoint[j][0], &vertexClosest[0], subId, &vertexCoords[0], dist2, &vertexWeights[0]);
    strm << "vtkVertex (" << vertexPoint[j][0] << ", " << vertexPoint[j][1] << ", "
         << vertexPoint[j][2] << ")" << endl;
    strm << "\tclosest: " << vertexClosest[0] << ", " << vertexClosest[1] << ", "
         << vertexClosest[2] << endl;
    strm << "\tcoords: " << vertexCoords[0] << endl;
    strm << "\tweights: " << vertexWeights[0] << endl;
    strm << "\tsubid: " << subId << endl;
    strm << "\tdist2: " << dist2 << endl;
    strm << endl;
  }

2. PolyVertex最近点

// Poly Vertex
  vtkPolyVertex* polyVertex = vtkPolyVertex::New();
  double polyVertexCoords[3], polyVertexWeights[2];
  double polyVertexPoint[3][3] = { { 10.0, 20.0, 30.0 }, { 30.0, 20.0, 10.0 }, { 0, 0, 0 } };
  double polyVertexClosest[3];

  polyVertex->GetPointIds()->SetNumberOfIds(2);
  polyVertex->GetPointIds()->SetId(0, 0);
  polyVertex->GetPointIds()->SetId(1, 1);

  polyVertex->GetPoints()->SetNumberOfPoints(2);
  polyVertex->GetPoints()->SetPoint(0, 10.0, 20.0, 30.0);
  polyVertex->GetPoints()->SetPoint(1, 30.0, 20.0, 10.0);

  n = sizeof(polyVertexPoint) / (3 * sizeof(double));
  for (j = 0; j < n; j++)
  {
    polyVertex->EvaluatePosition(&polyVertexPoint[j][0], &polyVertexClosest[0], subId,
      &polyVertexCoords[0], dist2, &polyVertexWeights[0]);
    strm << "vtkPolyVertex (" << polyVertexPoint[j][0] << ", " << polyVertexPoint[j][1] << ", "
         << polyVertexPoint[j][2] << ")" << endl;
    strm << "\tclosest: " << polyVertexClosest[0] << ", " << polyVertexClosest[1] << ", "
         << polyVertexClosest[2] << endl;
    strm << "\tcoords: " << polyVertexCoords[0] << endl;
    strm << "\tweights: " << polyVertexWeights[0] << endl;
    strm << "\tsubid: " << subId << endl;
    strm << "\tdist2: " << dist2 << endl;
    strm << endl;
  }

3. Line最近点

  // Line
  vtkLine* line = vtkLine::New();
  double lineCoords[3], lineWeights[2];
  double linePoint[3][3] = { { 10.0, 20.0, 30.0 }, { 30.0, 20.0, 10.0 }, { 0, 0, 0 } };
  double lineClosest[3];

  line->GetPointIds()->SetId(0, 0);
  line->GetPointIds()->SetId(1, 1);
  line->GetPoints()->SetPoint(0, 10.0, 20.0, 30.0);
  line->GetPoints()->SetPoint(1, 30.0, 20.0, 10.0);

  n = sizeof(linePoint) / (3 * sizeof(double));
  for (j = 0; j < n; j++)
  {
    line->EvaluatePosition(
      &linePoint[j][0], &lineClosest[0], subId, &lineCoords[0], dist2, &lineWeights[0]);
    strm << "vtkLine (" << linePoint[j][0] << ", " << linePoint[j][1] << ", " << linePoint[j][2]
         << ")" << endl;
    strm << "\tclosest: " << lineClosest[0] << ", " << lineClosest[1] << ", " << lineClosest[2]
         << endl;
    strm << "\tcoords: " << lineCoords[0] << endl;
    strm << "\tweights: " << lineWeights[0] << endl;
    strm << "\tsubid: " << subId << endl;
    strm << "\tdist2: " << dist2 << endl;
    strm << endl;
  }

4. PolyLine最近点

  // Poly Line
  vtkPolyLine* polyLine = vtkPolyLine::New();
  double polyLineCoords[3], polyLineWeights[3];
  double polyLinePoint[4][3] = { { 10.0, 20.0, 30.0 }, { 10.0, 30.0, 30.0 }, { 10.0, 30.0, 40.0 },
    { 0, 0, 0 } };
  double polyLineClosest[3];

  polyLine->GetPointIds()->SetNumberOfIds(3);
  polyLine->GetPointIds()->SetId(0, 0);
  polyLine->GetPointIds()->SetId(1, 1);
  polyLine->GetPointIds()->SetId(2, 2);

  polyLine->GetPoints()->SetNumberOfPoints(3);
  polyLine->GetPoints()->SetPoint(0, 10.0, 20.0, 30.0);
  polyLine->GetPoints()->SetPoint(1, 10.0, 30.0, 30.0);
  polyLine->GetPoints()->SetPoint(2, 10.0, 30.0, 40.0);

  n = sizeof(polyLinePoint) / (3 * sizeof(double));
  for (j = 0; j < n; j++)
  {
    polyLine->EvaluatePosition(&polyLinePoint[j][0], &polyLineClosest[0], subId, &polyLineCoords[0],
      dist2, &polyLineWeights[0]);
    strm << "vtkPolyLine (" << polyLinePoint[j][0] << ", " << polyLinePoint[j][1] << ", "
         << polyLinePoint[j][2] << ")" << endl;
    strm << "\tclosest: " << polyLineClosest[0] << ", " << polyLineClosest[1] << ", "
         << polyLineClosest[2] << endl;
    strm << "\tcoords: " << polyLineCoords[0] << endl;
    strm << "\tweights: " << polyLineWeights[0] << endl;
    strm << "\tsubid: " << subId << endl;
    strm << "\tdist2: " << dist2 << endl;
    strm << endl;
  }

4. Triangle最近点

  // Triangle
  vtkTriangle* triangle = vtkTriangle::New();
  double triangleCoords[3], triangleWeights[3], trianglePosition[3];
  double trianglePoint[4][3] = { { 10.0, 10.0, 10.0 }, { 12.0, 10.0, 10.0 }, { 11.0, 12.0, 12.0 },
    { 11, 11, 11 } };
  double triangleClosest[3];

  triangle->GetPointIds()->SetId(0, 0);
  triangle->GetPointIds()->SetId(1, 1);
  triangle->GetPointIds()->SetId(2, 2);

  triangle->GetPoints()->SetPoint(0, 10.0, 10.0, 10.0);
  triangle->GetPoints()->SetPoint(1, 12.0, 10.0, 10.0);
  triangle->GetPoints()->SetPoint(2, 11.0, 12.0, 12.0);

  n = sizeof(trianglePoint) / (3 * sizeof(double));
  for (j = 0; j < n; j++)
  {
    triangle->EvaluatePosition(&trianglePoint[j][0], &triangleClosest[0], subId, &triangleCoords[0],
      dist2, &triangleWeights[0]);
    strm << "vtkTriangle (" << trianglePoint[j][0] << ", " << trianglePoint[j][1] << ", "
         << trianglePoint[j][2] << ")" << endl;
    strm << "\tclosest: " << triangleClosest[0] << ", " << triangleClosest[1] << ", "
         << triangleClosest[2] << endl;
    strm << "\tcoords: " << triangleCoords[0] << ", " << triangleCoords[1] << ", "
         << triangleCoords[2] << endl;
    strm << "\tweights: " << triangleWeights[0] << ", " << triangleWeights[1] << ", "
         << triangleWeights[2] << endl;
    strm << "\tsubid: " << subId << endl;
    strm << "\tdist2: " << dist2 << endl;
    triangle->EvaluateLocation(subId, triangleCoords, trianglePosition, triangleWeights);
    strm << "\tposition: " << trianglePosition[0] << ", " << trianglePosition[1] << ", "
         << trianglePosition[2] << endl;
    strm << endl;
  }

5. TriangleStrip最近点

 // Triangle Strip
  vtkTriangleStrip* triangleStrip = vtkTriangleStrip::New();
  double triangleStripCoords[3], triangleStripWeights[4], triangleStripPosition[3];
  double triangleStripPoint[5][3] = { { 10.0, 10.0, 10.0 }, { 12.0, 10.0, 10.0 },
    { 11.0, 12.0, 10.0 }, { 13, 10, 10 }, { 11, 11, 10 } };
  double triangleStripClosest[3];

  triangleStrip->GetPointIds()->SetNumberOfIds(4);
  triangleStrip->GetPointIds()->SetId(0, 0);
  triangleStrip->GetPointIds()->SetId(1, 1);
  triangleStrip->GetPointIds()->SetId(2, 2);
  triangleStrip->GetPointIds()->SetId(3, 3);

  triangleStrip->GetPoints()->SetNumberOfPoints(4);
  triangleStrip->GetPoints()->SetPoint(0, 10.0, 10.0, 10.0);
  triangleStrip->GetPoints()->SetPoint(1, 12.0, 10.0, 10.0);
  triangleStrip->GetPoints()->SetPoint(2, 11.0, 12.0, 10.0);
  triangleStrip->GetPoints()->SetPoint(3, 13.0, 10.0, 10.0);

  n = sizeof(triangleStripPoint) / (3 * sizeof(double));
  for (j = 0; j < n; j++)
  {
    triangleStrip->EvaluatePosition(&triangleStripPoint[j][0], &triangleStripClosest[0], subId,
      &triangleStripCoords[0], dist2, &triangleStripWeights[0]);
    strm << "vtkTriangleStrip (" << triangleStripPoint[j][0] << ", " << triangleStripPoint[j][1]
         << ", " << triangleStripPoint[j][2] << ")" << endl;
    strm << "\tclosest: " << triangleStripClosest[0] << ", " << triangleStripClosest[1] << ", "
         << triangleStripClosest[2] << endl;
    strm << "\tcoords: " << triangleStripCoords[0] << ", " << triangleStripCoords[1] << ", "
         << triangleStripCoords[2] << endl;
    strm << "\tweights: " << triangleStripWeights[0] << ", " << triangleStripWeights[1] << ", "
         << triangleStripWeights[2] << endl;
    strm << "\tsubid: " << subId << endl;
    strm << "\tdist2: " << dist2 << endl;
    triangleStrip->EvaluateLocation(
      subId, triangleStripCoords, triangleStripPosition, triangleStripWeights);
    strm << "\tposition: " << triangleStripPosition[0] << ", " << triangleStripPosition[1] << ", "
         << triangleStripPosition[2] << endl;
    strm << endl;
  }

6. Quad最近点

  // Quad
  vtkQuad* quad = vtkQuad::New();
  double quadCoords[3], quadWeights[4], quadPosition[3];
  double quadPoint[5][3] = { { 10.0, 10.0, 10.0 }, { 12.0, 10.0, 10.0 }, { 12.0, 12.0, 10.0 },
    { 10, 12, 10 }, { 11, 11, 10.1 } };
  double quadClosest[3];

  quad->GetPointIds()->SetId(0, 0);
  quad->GetPointIds()->SetId(1, 1);
  quad->GetPointIds()->SetId(2, 2);
  quad->GetPointIds()->SetId(3, 3);

  quad->GetPoints()->SetPoint(0, 10.0, 10.0, 10.0);
  quad->GetPoints()->SetPoint(1, 12.0, 10.0, 10.0);
  quad->GetPoints()->SetPoint(2, 12.0, 12.0, 10.0);
  quad->GetPoints()->SetPoint(3, 10.0, 12.0, 10.0);

  n = sizeof(quadPoint) / (3 * sizeof(double));
  for (j = 0; j < n; j++)
  {
    quad->EvaluatePosition(
      &quadPoint[j][0], &quadClosest[0], subId, &quadCoords[0], dist2, &quadWeights[0]);
    strm << "vtkQuad (" << quadPoint[j][0] << ", " << quadPoint[j][1] << ", " << quadPoint[j][2]
         << ")" << endl;
    strm << "\tclosest: " << quadClosest[0] << ", " << quadClosest[1] << ", " << quadClosest[2]
         << endl;
    strm << "\tcoords: " << quadCoords[0] << ", " << quadCoords[1] << endl;
    strm << "\tweights: " << quadWeights[0] << ", " << quadWeights[1] << ", " << quadWeights[2]
         << ", " << quadWeights[3] << endl;
    strm << "\tsubid: " << subId << endl;
    strm << "\tdist2: " << dist2 << endl;
    quad->EvaluateLocation(subId, quadCoords, quadPosition, quadWeights);
    strm << "\tposition: " << quadPosition[0] << ", " << quadPosition[1] << ", " << quadPosition[2]
         << endl;
    strm << endl;
  }

7. Pixee最近点

  // Pixel
  vtkPixel* pixel = vtkPixel::New();
  double pixelCoords[3], pixelWeights[4], pixelPosition[3];
  double pixelPoint[5][3] = { { 10.0, 10.0, 10.0 }, { 12.0, 10.0, 10.0 }, { 12.0, 12.0, 10.0 },
    { 10, 12, 10 }, { 11, 11, 10.1 } };
  double pixelClosest[3];

  pixel->GetPointIds()->SetId(0, 0);
  pixel->GetPointIds()->SetId(1, 1);
  pixel->GetPointIds()->SetId(2, 3);
  pixel->GetPointIds()->SetId(3, 2);

  pixel->GetPoints()->SetPoint(0, 10.0, 10.0, 10.0);
  pixel->GetPoints()->SetPoint(1, 12.0, 10.0, 10.0);
  pixel->GetPoints()->SetPoint(3, 12.0, 12.0, 10.0);
  pixel->GetPoints()->SetPoint(2, 10.0, 12.0, 10.0);

  n = sizeof(pixelPoint) / (3 * sizeof(double));
  for (j = 0; j < n; j++)
  {
    pixel->EvaluatePosition(
      &pixelPoint[j][0], &pixelClosest[0], subId, &pixelCoords[0], dist2, &pixelWeights[0]);
    strm << "vtkPixel (" << pixelPoint[j][0] << ", " << pixelPoint[j][1] << ", " << pixelPoint[j][2]
         << ")" << endl;
    strm << "\tclosest: " << pixelClosest[0] << ", " << pixelClosest[1] << ", " << pixelClosest[2]
         << endl;
    strm << "\tcoords: " << pixelCoords[0] << ", " << pixelCoords[1] << endl;
    strm << "\tweights: " << pixelWeights[0] << ", " << pixelWeights[1] << ", " << pixelWeights[2]
         << ", " << pixelWeights[3] << endl;
    strm << "\tsubid: " << subId << endl;
    strm << "\tdist2: " << dist2 << endl;
    pixel->EvaluateLocation(subId, pixelCoords, pixelPosition, pixelWeights);
    strm << "\tposition: " << pixelPosition[0] << ", " << pixelPosition[1] << ", "
         << pixelPosition[2] << endl;
    strm << endl;
  }

8. polygon最近点

  // Polygon
  vtkPolygon* polygon = vtkPolygon::New();
  double polygonCoords[3], polygonWeights[4], polygonPosition[3];
  double polygonPoint[5][3] = { { 0.0, 0.0, 0.0 }, { 1.0, 0.0, 0.0 }, { 1.0, 1.0, 0.0 },
    { 0, 1, 0 }, { .5, .5, 0 } };
  double polygonClosest[3];

  polygon->GetPointIds()->SetNumberOfIds(4);
  polygon->GetPointIds()->SetId(0, 0);
  polygon->GetPointIds()->SetId(1, 1);
  polygon->GetPointIds()->SetId(2, 2);
  polygon->GetPointIds()->SetId(3, 3);

  polygon->GetPoints()->SetNumberOfPoints(4);
  polygon->GetPoints()->SetPoint(0, 0.0, 0.0, 0.0);
  polygon->GetPoints()->SetPoint(1, 1.0, 0.0, 0.0);
  polygon->GetPoints()->SetPoint(2, 1.0, 1.0, 0.0);
  polygon->GetPoints()->SetPoint(3, 0.0, 1.0, 0.0);

  n = sizeof(polygonPoint) / (3 * sizeof(double));
  for (j = 0; j < n; j++)
  {
    polygon->EvaluatePosition(
      &polygonPoint[j][0], &polygonClosest[0], subId, &polygonCoords[0], dist2, &polygonWeights[0]);
    strm << "vtkPolygon (" << polygonPoint[j][0] << ", " << polygonPoint[j][1] << ", "
         << polygonPoint[j][2] << ")" << endl;
    strm << "\tclosest: " << polygonClosest[0] << ", " << polygonClosest[1] << ", "
         << polygonClosest[2] << endl;
    strm << "\tcoords: " << polygonCoords[0] << ", " << polygonCoords[1] << endl;
    strm << "\tweights: " << polygonWeights[0] << ", " << polygonWeights[1] << ", "
         << polygonWeights[2] << ", " << polygonWeights[3] << endl;
    strm << "\tsubid: " << subId << endl;
    strm << "\tdist2: " << dist2 << endl;
    polygon->EvaluateLocation(subId, polygonCoords, polygonPosition, polygonWeights);
    strm << "\tposition: " << polygonPosition[0] << ", " << polygonPosition[1] << ", "
         << polygonPosition[2] << endl;
    strm << endl;
  }

9. Tetra最近点

  // Tetra
  vtkTetra* tetra = vtkTetra::New();
  double tetraCoords[3], tetraWeights[4], tetraPosition[3];
  double tetraPoint[5][3] = { { 10, 10, 10 }, { 12, 10, 10 }, { 11, 12, 10 }, { 11, 11, 12 },
    { 11, 11, 11 } };
  double tetraClosest[3];

  tetra->GetPointIds()->SetNumberOfIds(4);
  tetra->GetPointIds()->SetId(0, 0);
  tetra->GetPointIds()->SetId(1, 1);
  tetra->GetPointIds()->SetId(2, 2);
  tetra->GetPointIds()->SetId(3, 3);
  tetra->GetPoints()->SetPoint(0, 10.0, 10.0, 10.0);
  tetra->GetPoints()->SetPoint(1, 12.0, 10.0, 10.0);
  tetra->GetPoints()->SetPoint(2, 11.0, 12.0, 10.0);
  tetra->GetPoints()->SetPoint(3, 11.0, 11.0, 12.0);

  n = sizeof(tetraPoint) / (3 * sizeof(double));
  for (j = 0; j < n; j++)
  {
    tetra->EvaluatePosition(
      &tetraPoint[j][0], &tetraClosest[0], subId, &tetraCoords[0], dist2, &tetraWeights[0]);
    strm << "vtkTetra (" << tetraPoint[j][0] << ", " << tetraPoint[j][1] << ", " << tetraPoint[j][2]
         << ")" << endl;
    strm << "\tclosest: " << tetraClosest[0] << ", " << tetraClosest[1] << ", " << tetraClosest[2]
         << endl;
    strm << "\tcoords: " << tetraCoords[0] << ", " << tetraCoords[1] << ", " << tetraCoords[2]
         << endl;
    strm << "\tweights: " << tetraWeights[0] << ", " << tetraWeights[1] << ", " << tetraWeights[2]
         << ", " << tetraWeights[3] << endl;
    strm << "\tsubid: " << subId << endl;
    strm << "\tdist2: " << dist2 << endl;
    tetra->EvaluateLocation(subId, tetraCoords, tetraPosition, tetraWeights);
    strm << "\tposition: " << tetraPosition[0] << ", " << tetraPosition[1] << ", "
         << tetraPosition[2] << endl;
    strm << endl;
  }

10. voxel最近点

// Voxel
  vtkVoxel* voxel = vtkVoxel::New();
  double voxelCoords[3], voxelWeights[8], voxelPosition[3];
  double voxelPoint[9][3] = { { 10, 10, 10 }, { 12, 10, 10 }, { 12, 12, 10 }, { 10, 12, 10 },
    { 10, 10, 12 }, { 12, 10, 12 }, { 12, 12, 12 }, { 10, 12, 12 }, { 11, 11, 11 } };
  double voxelClosest[3];

  voxel->GetPointIds()->SetNumberOfIds(8);
  voxel->GetPointIds()->SetId(0, 0);
  voxel->GetPointIds()->SetId(1, 1);
  voxel->GetPointIds()->SetId(2, 3);
  voxel->GetPointIds()->SetId(3, 2);
  voxel->GetPointIds()->SetId(4, 4);
  voxel->GetPointIds()->SetId(5, 5);
  voxel->GetPointIds()->SetId(6, 7);
  voxel->GetPointIds()->SetId(7, 6);

  voxel->GetPoints()->SetPoint(0, 10, 10, 10);
  voxel->GetPoints()->SetPoint(1, 12, 10, 10);
  voxel->GetPoints()->SetPoint(3, 12, 12, 10);
  voxel->GetPoints()->SetPoint(2, 10, 12, 10);
  voxel->GetPoints()->SetPoint(4, 10, 10, 12);
  voxel->GetPoints()->SetPoint(5, 12, 10, 12);
  voxel->GetPoints()->SetPoint(7, 12, 12, 12);
  voxel->GetPoints()->SetPoint(6, 10, 12, 12);

  n = sizeof(voxelPoint) / (3 * sizeof(double));
  for (j = 0; j < n; j++)
  {
    voxel->EvaluatePosition(
      &voxelPoint[j][0], &voxelClosest[0], subId, &voxelCoords[0], dist2, &voxelWeights[0]);
    strm << "vtkVoxel (" << voxelPoint[j][0] << ", " << voxelPoint[j][1] << ", " << voxelPoint[j][2]
         << ")" << endl;
    strm << "\tclosest: " << voxelClosest[0] << ", " << voxelClosest[1] << ", " << voxelClosest[2]
         << endl;
    strm << "\tcoords: " << voxelCoords[0] << ", " << voxelCoords[1] << ", " << voxelCoords[2]
         << endl;
    strm << "\tweights: " << voxelWeights[0] << ", " << voxelWeights[1] << ", " << voxelWeights[2]
         << ", " << voxelWeights[3] << endl;
    strm << "\tsubid: " << subId << endl;
    strm << "\tdist2: " << dist2 << endl;
    voxel->EvaluateLocation(subId, voxelCoords, voxelPosition, voxelWeights);
    strm << "\tposition: " << voxelPosition[0] << ", " << voxelPosition[1] << ", "
         << voxelPosition[2] << endl;
    strm << endl;
  }

11. wedge最近点

  // Wedge
  vtkWedge* wedge = vtkWedge::New();
  double wedgeCoords[3], wedgeWeights[8], wedgePosition[3];
  double wedgePoint[9][3] = { { 10, 10, 10 }, { 12, 10, 10 }, { 11, 12, 10 }, { 10, 10, 12 },
    { 12, 10, 12 }, { 11, 12, 12 }, { 11, 11, 11 } };
  double wedgeClosest[3];

  wedge->GetPointIds()->SetNumberOfIds(6);
  wedge->GetPointIds()->SetId(0, 0);
  wedge->GetPointIds()->SetId(1, 1);
  wedge->GetPointIds()->SetId(2, 2);
  wedge->GetPointIds()->SetId(3, 3);
  wedge->GetPointIds()->SetId(4, 4);
  wedge->GetPointIds()->SetId(5, 5);

  wedge->GetPoints()->SetPoint(0, 10, 10, 10);
  wedge->GetPoints()->SetPoint(1, 12, 10, 10);
  wedge->GetPoints()->SetPoint(2, 11, 12, 10);
  wedge->GetPoints()->SetPoint(3, 10, 10, 12);
  wedge->GetPoints()->SetPoint(4, 12, 10, 12);
  wedge->GetPoints()->SetPoint(5, 11, 12, 12);

  n = sizeof(wedgePoint) / (3 * sizeof(double));
  for (j = 0; j < n; j++)
  {
    wedge->EvaluatePosition(
      &wedgePoint[j][0], &wedgeClosest[0], subId, &wedgeCoords[0], dist2, &wedgeWeights[0]);
    strm << "vtkWedge (" << wedgePoint[j][0] << ", " << wedgePoint[j][1] << ", " << wedgePoint[j][2]
         << ")" << endl;
    strm << "\tclosest: " << wedgeClosest[0] << ", " << wedgeClosest[1] << ", " << wedgeClosest[2]
         << endl;
    strm << "\tcoords: " << wedgeCoords[0] << ", " << wedgeCoords[1] << ", " << wedgeCoords[2]
         << endl;
    strm << "\tweights: " << wedgeWeights[0] << ", " << wedgeWeights[1] << ", " << wedgeWeights[2]
         << ", " << wedgeWeights[3] << endl;
    strm << "\tsubid: " << subId << endl;
    strm << "\tdist2: " << dist2 << endl;
    wedge->EvaluateLocation(subId, wedgeCoords, wedgePosition, wedgeWeights);
    strm << "\tposition: " << wedgePosition[0] << ", " << wedgePosition[1] << ", "
         << wedgePosition[2] << endl;
    strm << endl;
  }

12. Hexahedron最近点

 // Hexahedron
  vtkHexahedron* hexahedron = vtkHexahedron::New();
  double hexahedronCoords[3], hexahedronWeights[8], hexahedronPosition[3];
  double hexahedronPoint[9][3] = { { 10, 10, 10 }, { 12, 10, 10 }, { 12, 12, 10 }, { 10, 12, 10 },
    { 10, 10, 12 }, { 12, 10, 12 }, { 12, 12, 12 }, { 10, 12, 12 }, { 11, 11, 11 } };
  double hexahedronClosest[3];

  hexahedron->GetPointIds()->SetNumberOfIds(8);
  hexahedron->GetPointIds()->SetId(0, 0);
  hexahedron->GetPointIds()->SetId(1, 1);
  hexahedron->GetPointIds()->SetId(2, 2);
  hexahedron->GetPointIds()->SetId(3, 3);
  hexahedron->GetPointIds()->SetId(4, 4);
  hexahedron->GetPointIds()->SetId(5, 5);
  hexahedron->GetPointIds()->SetId(6, 6);
  hexahedron->GetPointIds()->SetId(7, 7);

  hexahedron->GetPoints()->SetPoint(0, 10, 10, 10);
  hexahedron->GetPoints()->SetPoint(1, 12, 10, 10);
  hexahedron->GetPoints()->SetPoint(2, 12, 12, 10);
  hexahedron->GetPoints()->SetPoint(3, 10, 12, 10);
  hexahedron->GetPoints()->SetPoint(4, 10, 10, 12);
  hexahedron->GetPoints()->SetPoint(5, 12, 10, 12);
  hexahedron->GetPoints()->SetPoint(6, 12, 12, 12);
  hexahedron->GetPoints()->SetPoint(7, 10, 12, 12);

  n = sizeof(hexahedronPoint) / (3 * sizeof(double));
  for (j = 0; j < n; j++)
  {
    hexahedron->EvaluatePosition(&hexahedronPoint[j][0], &hexahedronClosest[0], subId,
      &hexahedronCoords[0], dist2, &hexahedronWeights[0]);
    strm << "vtkHexahedron (" << hexahedronPoint[j][0] << ", " << hexahedronPoint[j][1] << ", "
         << hexahedronPoint[j][2] << ")" << endl;
    strm << "\tclosest: " << hexahedronClosest[0] << ", " << hexahedronClosest[1] << ", "
         << hexahedronClosest[2] << endl;
    strm << "\tcoords: " << hexahedronCoords[0] << ", " << hexahedronCoords[1] << ", "
         << hexahedronCoords[2] << endl;
    strm << "\tweights: " << hexahedronWeights[0] << ", " << hexahedronWeights[1] << ", "
         << hexahedronWeights[2] << ", " << hexahedronWeights[3] << endl;
    strm << "\tsubid: " << subId << endl;
    strm << "\tdist2: " << dist2 << endl;
    hexahedron->EvaluateLocation(subId, hexahedronCoords, hexahedronPosition, hexahedronWeights);
    strm << "\tposition: " << hexahedronPosition[0] << ", " << hexahedronPosition[1] << ", "
         << hexahedronPosition[2] << endl;
    strm << endl;
  }

13. pentagonal prism最近点

// Pentagonal Prism
  vtkPentagonalPrism* penta = vtkPentagonalPrism::New();
  double pentaCoords[3], pentaWeights[10], pentaPosition[3];
  double pentaPoint[11][3] = { { 11, 10, 10 }, { 13, 10, 10 }, { 14, 12, 10 }, { 12, 14, 10 },
    { 10, 12, 10 }, { 11, 10, 14 }, { 13, 10, 14 }, { 14, 12, 14 }, { 12, 14, 14 }, { 10, 12, 14 },
    { 12, 12, 12 } };
  double pentaClosest[3];

  penta->GetPointIds()->SetNumberOfIds(10);
  penta->GetPointIds()->SetId(0, 0);
  penta->GetPointIds()->SetId(1, 1);
  penta->GetPointIds()->SetId(2, 2);
  penta->GetPointIds()->SetId(3, 3);
  penta->GetPointIds()->SetId(4, 4);
  penta->GetPointIds()->SetId(5, 5);
  penta->GetPointIds()->SetId(6, 6);
  penta->GetPointIds()->SetId(7, 7);
  penta->GetPointIds()->SetId(8, 8);
  penta->GetPointIds()->SetId(9, 9);

  penta->GetPoints()->SetPoint(0, 11, 10, 10);
  penta->GetPoints()->SetPoint(1, 13, 10, 10);
  penta->GetPoints()->SetPoint(2, 14, 12, 10);
  penta->GetPoints()->SetPoint(3, 12, 14, 10);
  penta->GetPoints()->SetPoint(4, 10, 12, 10);
  penta->GetPoints()->SetPoint(5, 11, 10, 14);
  penta->GetPoints()->SetPoint(6, 13, 10, 14);
  penta->GetPoints()->SetPoint(7, 14, 12, 14);
  penta->GetPoints()->SetPoint(8, 12, 14, 14);
  penta->GetPoints()->SetPoint(9, 10, 12, 14);

  n = sizeof(pentaPoint) / (3 * sizeof(double));
  for (j = 0; j < n; j++)
  {
    penta->EvaluatePosition(
      &pentaPoint[j][0], &pentaClosest[0], subId, &pentaCoords[0], dist2, &pentaWeights[0]);
    strm << "vtkPentagonalPrism (" << pentaPoint[j][0] << ", " << pentaPoint[j][1] << ", "
         << pentaPoint[j][2] << ")" << endl;
    strm << "\tclosest: " << pentaClosest[0] << ", " << pentaClosest[1] << ", " << pentaClosest[2]
         << endl;
    strm << "\tcoords: " << pentaCoords[0] << ", " << pentaCoords[1] << ", " << pentaCoords[2]
         << endl;
    strm << "\tweights: " << pentaWeights[0] << ", " << pentaWeights[1] << ", " << pentaWeights[2]
         << ", " << pentaWeights[3] << endl;
    strm << "\tsubid: " << subId << endl;
    strm << "\tdist2: " << dist2 << endl;
    penta->EvaluateLocation(subId, pentaCoords, pentaPosition, pentaWeights);
    strm << "\tposition: " << pentaPosition[0] << ", " << pentaPosition[1] << ", "
         << pentaPosition[2] << endl;
    strm << endl;
  }

14. Hexagonal prism最近点

 // Hexagonal Prism
  vtkHexagonalPrism* hexa = vtkHexagonalPrism::New();
  double hexaCoords[3], hexaWeights[12], hexaPosition[3];
  double hexaPoint[13][3] = { { 11, 10, 10 }, { 13, 10, 10 }, { 14, 12, 10 }, { 13, 14, 10 },
    { 11, 14, 10 }, { 10, 12, 10 }, { 11, 10, 14 }, { 13, 10, 14 }, { 14, 12, 14 }, { 13, 14, 14 },
    { 11, 14, 14 }, { 10, 12, 14 }, { 12, 12, 12 } };
  double hexaClosest[3];

  hexa->GetPointIds()->SetNumberOfIds(12);
  hexa->GetPointIds()->SetId(0, 0);
  hexa->GetPointIds()->SetId(1, 1);
  hexa->GetPointIds()->SetId(2, 2);
  hexa->GetPointIds()->SetId(3, 3);
  hexa->GetPointIds()->SetId(4, 4);
  hexa->GetPointIds()->SetId(5, 5);
  hexa->GetPointIds()->SetId(6, 6);
  hexa->GetPointIds()->SetId(7, 7);
  hexa->GetPointIds()->SetId(8, 8);
  hexa->GetPointIds()->SetId(9, 9);
  hexa->GetPointIds()->SetId(10, 10);
  hexa->GetPointIds()->SetId(11, 11);

  hexa->GetPoints()->SetPoint(0, 11, 10, 10);
  hexa->GetPoints()->SetPoint(1, 13, 10, 10);
  hexa->GetPoints()->SetPoint(2, 14, 12, 10);
  hexa->GetPoints()->SetPoint(3, 13, 14, 10);
  hexa->GetPoints()->SetPoint(4, 11, 14, 10);
  hexa->GetPoints()->SetPoint(5, 10, 12, 10);
  hexa->GetPoints()->SetPoint(6, 11, 10, 14);
  hexa->GetPoints()->SetPoint(7, 13, 10, 14);
  hexa->GetPoints()->SetPoint(8, 14, 12, 14);
  hexa->GetPoints()->SetPoint(9, 13, 14, 14);
  hexa->GetPoints()->SetPoint(10, 11, 14, 14);
  hexa->GetPoints()->SetPoint(11, 10, 12, 14);

  n = sizeof(hexaPoint) / (3 * sizeof(double));
  for (j = 0; j < n; j++)
  {
    hexa->EvaluatePosition(
      &hexaPoint[j][0], &hexaClosest[0], subId, &hexaCoords[0], dist2, &hexaWeights[0]);
    strm << "vtkHexagonalPrism (" << hexaPoint[j][0] << ", " << hexaPoint[j][1] << ", "
         << hexaPoint[j][2] << ")" << endl;
    strm << "\tclosest: " << hexaClosest[0] << ", " << hexaClosest[1] << ", " << hexaClosest[2]
         << endl;
    strm << "\tcoords: " << hexaCoords[0] << ", " << hexaCoords[1] << ", " << hexaCoords[2] << endl;
    strm << "\tweights: " << hexaWeights[0] << ", " << hexaWeights[1] << ", " << hexaWeights[2]
         << ", " << hexaWeights[3] << endl;
    strm << "\tsubid: " << subId << endl;
    strm << "\tdist2: " << dist2 << endl;
    hexa->EvaluateLocation(subId, hexaCoords, hexaPosition, hexaWeights);
    strm << "\tposition: " << hexaPosition[0] << ", " << hexaPosition[1] << ", " << hexaPosition[2]
         << endl;
    strm << endl;
  }

  ids->Delete();
  vertex->Delete();
  polyVertex->Delete();
  line->Delete();
  polyLine->Delete();
  triangle->Delete();
  triangleStrip->Delete();
  quad->Delete();
  pixel->Delete();
  polygon->Delete();
  tetra->Delete();
  voxel->Delete();
  wedge->Delete();
  hexahedron->Delete();
  penta->Delete();
  hexa->Delete();

15. 注意

? ? ? ? Weights[]数组的大小与输入的vtkPoints的个数相关。

结论：

感谢各位小伙伴的点赞+关注，小易会继续努力分享，一起进步！

你的赞赏是我的最最最最大的动力(＾Ｕ＾)ノ~ＹＯ

文章来源:https://blog.csdn.net/qq_40041064/article/details/135019667
本文来自互联网用户投稿，该文观点仅代表作者本人，不代表本站立场。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如若内容造成侵权/违法违规/事实不符，请联系我的编程经验分享网邮箱：veading@qq.com进行投诉反馈，一经查实，立即删除！