vtkTriangle 三角形

C++程序员Carea

已于 2022-03-31 14:48:17 修改

阅读量1k

点赞数

CC 4.0 BY-SA版权

分类专栏： VTK/ITK 文章标签： c++

于 2022-03-31 14:46:12 首次发布

原文链接：https://blog.youkuaiyun.com/it_xiangqiang/article/details/116451366

VTK/ITK 专栏收录该内容

73 篇文章 ¥69.90 ¥99.00

订阅专栏

超级会员免费看

本文详细探讨了在C++中使用vtkTriangle库进行三角形处理的方法，包括其原理和应用示例。


#include <iostream>
using namespace std;
#include <vtkCellArray.h>
#include <vtkIdList.h>
#include <vtkNew.h>
#include <vtkPolyData.h>
#include <vtkTriangle.h>

int main(int, char* [])
{
    vtkNew<vtkTriangle> triangle;
    triangle->GetPoints()->SetPoint(0, 1.0, 0.0, 0.0);
    triangle->GetPoints()->SetPoint(1, 0.0, 0.0, 0.0);
    triangle->GetPoints()->SetPoint(2, 0.0, 1.0, 0.0);
    triangle->GetPointIds()->SetId(0, 0);
    triangle->GetPointIds()->SetId(1, 1);
    triangle->GetPointIds()->SetId(2, 2);

    std::cout << "The cell has " << triangle->GetNumberOfEdges() << " edges."
        << std::endl;

    for (vtkIdType i = 0; i < triangle->GetNumberOfEdges(); i++)
    {
        vtkCell* edge = triangle->GetEdge(i);

        vtkIdList* pointIdList = edge->GetPointIds();
        std::cout << "Edge " << i << " has " << pointIdList->GetNumberOfIds()
            << " points." << std::endl;

        for (vtkIdType p = 0; p < pointIdList->GetNumberOfIds(); p++)
        {
            auto pointId = pointIdList->GetId(p);
            auto point = triangle->GetPoints()->GetPoint(pointId);
            std::cout << "Edge " << i << " uses point " << pointIdList->GetId(p)
                <<" [" << point[0] << ", " << point[1] << ", " << point[2] << "]"
                << std::endl;
        }
    }

    return EXIT_SUCCESS;
}

输出：

The cell has 3 edges.
Edge 0 has 2 points.
Edge 0 uses point 0 [1, 0, 0]
Edge 0 uses point 1 [0, 0, 0]
Edge 1 has 2 points.
Edge 1 uses point 1 [0, 0, 0]
Edge 1 uses point 2 [0, 1, 0]
Edge 2 has 2 points.
Edge 2 uses point 2 [0, 1, 0]
Edge 2 uses point 0 [1, 0, 0]