Repository navigation
Expand file tree
/
Copy pathvtk.cpp
More file actions
133 lines (112 loc) · 3.72 KB
/
Copy pathvtk.cpp
File metadata and controls
133 lines (112 loc) · 3.72 KB
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
#include "vtk.h"
//std
#include <map>
#include <set>
#include <utility>
// OpenCASCADE
#include <gp_Pnt.hxx>
#include <Poly_Triangle.hxx>
#include <TColgp_Array1OfPnt.hxx>
// VTK
#include <vtkCellArray.h>
#include <vtkCellData.h>
#include <vtkDataSetAttributes.h>
#include <vtkUnsignedCharArray.h>
#include <vtkTriangle.h>
struct vertex {
double x;
double y;
double z;
vertex(double x_, double y_, double z_) : x(x_), y(y_), z(z_) {
}
bool operator<(const vertex& other) const
{
if (x != other.x)
return (x < other.x);
if (y != other.y)
return (y < other.y);
return (z < other.z);
}
};
/**
* @brief Convert Cascade triangulation to vtk triangulation
*
**/
vtkSmartPointer<vtkPolyData> VTK_Helper::cascade_to_vtk(const std::vector<Handle(Poly_Triangulation)>& cascade_data) {
int point_counter = 0; // fix this
int face_counter = 0;
vtkSmartPointer<vtkPoints> points = vtkSmartPointer<vtkPoints>::New();
vtkSmartPointer<vtkCellArray> cells = vtkSmartPointer<vtkCellArray>::New();
std::map<vertex, int> point_map;
std::map<int, std::vector< vtkSmartPointer<vtkTriangle> > > faces;
for(std::vector<Handle(Poly_Triangulation)>::const_iterator it = cascade_data.begin();
it != cascade_data.end();
++it) {
std::vector< vtkSmartPointer<vtkTriangle> > triangles;
//Nodes are 1 indexed WTF?! why?
for(int i = 1; i <= (*it)->NbNodes(); i++) {
gp_Pnt point = (*it)->Nodes().Value(i);
vertex p(point.X(), point.Y(), point.Z());
if(!point_map.count(p)) {
point_map.insert(std::make_pair(p, point_counter));
point_counter++;
points->InsertNextPoint(p.x, p.y, p.z);
}
}
//as are triangles
for(int i = 1; i <= (*it)->NbTriangles(); i++) {
vtkSmartPointer<vtkTriangle> triangle = vtkSmartPointer<vtkTriangle>::New();
Poly_Triangle pt = (*it)->Triangles().Value(i);
int index0, index1, index2;
pt.Get(index0, index1, index2);
gp_Pnt point0 = (*it)->Nodes().Value(index0);
vertex p0(point0.X(), point0.Y(), point0.Z());
index0 = point_map[p0];
triangle->GetPointIds()->SetId(0, index0);
gp_Pnt point1 = (*it)->Nodes().Value(index1);
vertex p1(point1.X(), point1.Y(), point1.Z());
index1 = point_map[p1];
triangle->GetPointIds()->SetId(1, index1);
gp_Pnt point2 = (*it)->Nodes().Value(index2);
vertex p2(point2.X(), point2.Y(), point2.Z());
index2 = point_map[p2];
triangle->GetPointIds()->SetId(2, index2);
triangles.push_back(triangle);
cells->InsertNextCell(triangle);
}
faces.insert(std::make_pair(face_counter, triangles));
face_counter++;
break_points.push_back((*it)->NbTriangles());
}
poly_data->SetPoints(points);
poly_data->SetPolys(cells);
return poly_data;
}
VTK_Helper::VTK_Helper() {
poly_data = vtkSmartPointer<vtkPolyData>::New();
}
void VTK_Helper::colour_original_faces() {
//Colour Faces
vtkSmartPointer<vtkUnsignedCharArray> colours = vtkSmartPointer<vtkUnsignedCharArray>::New();
colours->SetNumberOfComponents(3);
colours->SetName("Colours");
for(std::vector<int>::iterator it = break_points.begin(); it != break_points.end(); ++it) {
unsigned char red = rand() % 256;
unsigned char green = rand() % 256;
unsigned char blue = rand() % 256;
for( int i = 0; i < *it; i++) {
colours->InsertNextTuple3(red, green, blue);
}
}
poly_data->GetCellData()->SetScalars(colours);
}
void normalise_vtk_actor(vtkSmartPointer<vtkActor> actor) {
double* bounds;
bounds = actor->GetBounds();
double largest = 0;
for(int i = 0; i < 3; i++) {
double size = fabs(bounds[i*2 + 1] - bounds[i * 2]);
largest = std::max(largest, size);
}
actor->SetScale(1/largest);
}