基于VTK的Delaunay的三角剖分算法

首页 > 基于VTK的Delaunay的三角剖分算法

基于VTK的Delaunay的三角剖分算法

实现效果：

开发环境：VS2015 + VTK5.10

#define vtkRenderingCore_AUTOINIT 4(vtkInteractionStyle,vtkRenderingFreeType,vtkRenderingFreeTypeOpenGL,vtkRenderingOpenGL) 
#define vtkRenderingVolume_AUTOINIT 1(vtkRenderingVolumeOpenGL)#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include "vtkCellArray.h"
#include "vtkInteractorStyleTrackballCamera.h"using namespace std;int main()
{ unsigned int gridSize = 20;vtkSmartPointer<vtkPoints> points =vtkSmartPointer<vtkPoints>::New();for (unsigned int x = 0; x < gridSize; x++){ for (unsigned int y = 0; y < gridSize; y++){ points->InsertNextPoint(x, y, vtkMath::Random(0.0, 3.0));}}vtkSmartPointer<vtkPolyData> polydata =vtkSmartPointer<vtkPolyData>::New();polydata->SetPoints(points);vtkSmartPointer<vtkDelaunay2D> delaunay =vtkSmartPointer<vtkDelaunay2D>::New();delaunay->SetInput(polydata);delaunay->Update();vtkSmartPointer<vtkVertexGlyphFilter> glyphFilter =vtkSmartPointer<vtkVertexGlyphFilter>::New();glyphFilter->SetInput(polydata);glyphFilter->Update();vtkSmartPointer<vtkPolyDataMapper> pointsMapper =vtkSmartPointer<vtkPolyDataMapper>::New();pointsMapper->SetInput(glyphFilter->GetOutput());vtkSmartPointer<vtkActor> pointsActor =vtkSmartPointer<vtkActor>::New();pointsActor->SetMapper(pointsMapper);pointsActor->GetProperty()->SetPointSize(5);pointsActor->GetProperty()->SetColor(1, 0, 0);vtkSmartPointer<vtkPolyDataMapper> triangulatedMapper =vtkSmartPointer<vtkPolyDataMapper>::New();triangulatedMapper->SetInputConnection(delaunay->GetOutputPort());vtkSmartPointer<vtkActor> triangulatedActor =vtkSmartPointer<vtkActor>::New();triangulatedActor->SetMapper(triangulatedMapper);triangulatedActor->GetProperty()->SetColor(0, 0, 0);triangulatedActor->GetProperty()->EdgeVisibilityOn();triangulatedActor->GetProperty()->SetEdgeColor(1, 1, 1);int j = 0;vtkIdType npts, *pts;vtkCellArray* oCellArr = vtkCellArray::New();//输出每个三角形的索引，vtk是从左下角开始计数的//while (delaunay->GetOutput()->GetPolys()->GetNextCell(npts, pts)) { //	cout << "triangle [" << pts[0] << " " << pts[1] << " " << pts[2] <<//		"]" << endl;//}vtkSmartPointer<vtkRenderer> renderer =vtkSmartPointer<vtkRenderer>::New();renderer->AddActor(pointsActor);renderer->AddActor(triangulatedActor);renderer->SetBackground(0, 0, 0);vtkSmartPointer<vtkRenderWindow> renderWindow =vtkSmartPointer<vtkRenderWindow>::New();renderWindow->AddRenderer(renderer);renderWindow->SetSize(640, 640);renderWindow->Render();renderWindow->SetWindowName("PolyData Delaunay2D");vtkSmartPointer<vtkRenderWindowInteractor> renderWindowInteractor =vtkSmartPointer<vtkRenderWindowInteractor>::New();renderWindowInteractor->SetRenderWindow(renderWindow);vtkInteractorStyleTrackballCamera *style = vtkInteractorStyleTrackballCamera::New();renderWindowInteractor->SetInteractorStyle(style);renderWindowInteractor->Initialize();renderWindowInteractor->Start();return 0;
}

如果想获得每个三角面片的顶点索引

vtkIdType npts, *pt_id;
bool 是否还有顶点 = delaunay->GetOutput()->GetPolys()->GetNextCell(npts, pt_id);
//npts是一个cell有多少的顶点，这里是三角形，所以是3；pt_id是位于同一个cell的几个顶点索引，大小为npts

如果是想获得每个三角面片的顶点位置：

vtkPoints *pt = delaunay_->GetOutput()->GetPoints();
double *p0 = pt->GetPoint(pt_id[0]);
double *p1 = pt->GetPoint(pt_id[1]);
double *p2 = pt->GetPoint(pt_id[2]);
//p0 是坐标数组，有p0[0],p0[1],p0[2]表示xyz的位置

如果想获得所有顶点数目

const int num = pt->GetNumberOfPoints();

如果想获得所有面片数目：

const int cells = delaunay_->GetOutput()->GetPolys()->GetNumberOfCells();

如果想删除顶点或面片

参考文献

C++/Python：

Ref. 1.

Ref. 2

Ref. 3

VTK:

Ref. 4

Ref. 5

Ref. 6

基于VTK的Delaunay的三角剖分算法

实现效果：

开发环境：VS2015 + VTK5.10

参考文献

更多相关：

PCL点云分割（2）

PCL点云配准（2）

PCL点云变换与移除NaN

PCL滤波介绍(3)

PCL滤波介绍（2）

Qt 4 学习1

leetcode-21 合并两个有序链表

.NET 端口监听

实现分布式服务注册及简易的netty聊天

将前台日期格式转成与数据库日期格式相对应，后台java转数据库日期格式