2 // Before editing this file, make sure it's a file of your own (i.e.: it wasn't generated from xml description; if so : your modifications will be lost)
4 #include "bbcreaVtkCreateMeshFromPoints.h"
5 #include "bbcreaVtkPackage.h"
7 #include "vtkTriangleStrip.h"
13 BBTK_ADD_BLACK_BOX_TO_PACKAGE(creaVtk,CreateMeshFromPoints)
14 BBTK_BLACK_BOX_IMPLEMENTATION(CreateMeshFromPoints,bbtk::AtomicBlackBox);
16 // Before editing this file, make sure it's a file of your own (i.e.: it wasn't generated from xml description; if so : your modifications will be lost)
18 void CreateMeshFromPoints::Process()
21 // THE MAIN PROCESSING METHOD BODY
22 // Here we simply set the input 'In' value to the output 'Out'
23 // And print out the output value
24 // INPUT/OUTPUT ACCESSORS ARE OF THE FORM :
25 // void bbSet{Input|Output}NAME(const TYPE&)
26 // const TYPE& bbGet{Input|Output}NAME() const
28 // * NAME is the name of the input/output
29 // (the one provided in the attribute 'name' of the tag 'input')
30 // * TYPE is the C++ type of the input/output
31 // (the one provided in the attribute 'type' of the tag 'input')
33 // bbSetOutputOut( bbGetInputIn() );
34 // std::cout << "Output value = " <<bbGetOutputOut() << std::endl;
36 std::vector<double> lstX = bbGetInputLstX();
37 std::vector<double> lstY = bbGetInputLstY();
38 std::vector<double> lstZ = bbGetInputLstZ();
39 std::vector<int> lstIndexs = bbGetInputLstIndexs();
40 if ( (lstIndexs.size()<=1) || (lstX.size()==0) || (lstX.size()!=lstY.size()) || (lstY.size()!=lstZ.size()) )
42 printf("PG CreateMeshFromPoints::Process: List of points X Y Z and LstIndexes is not correct\n");
45 int ii,sizeSegment1,sizeSegment2;
47 // vtkSmartPointer<vtkPoints> points = vtkSmartPointer<vtkPoints>::New();
48 if (points!=NULL) points->Delete();
49 points = vtkPoints::New();
50 int i,sizeLstX = lstX.size();
51 for (i=0;i<sizeLstX;i++)
53 points->InsertNextPoint(lstX[i],lstY[i],lstZ[i]);
55 // vtkSmartPointer<vtkCellArray> cells = vtkSmartPointer<vtkCellArray>::New();
56 if (cells!=NULL) cells->Delete();
57 cells = vtkCellArray::New();
59 int maxSegment1,maxSegment2;
62 int sizeLstIdexes=lstIndexs.size();
63 for (i=0; i<sizeLstIdexes-1; i++ )
65 sizeSegment1 = lstIndexs[i];
66 sizeSegment2 = lstIndexs[i+1];
67 vtkSmartPointer<vtkTriangleStrip> triangleStrip = vtkSmartPointer<vtkTriangleStrip>::New();
68 triangleStrip->GetPointIds()->SetNumberOfIds(sizeSegment1+sizeSegment2);
69 maxElements=sizeSegment1;
70 if (maxElements<sizeSegment2) maxElements=sizeSegment2;
71 maxSegment1 = iGeneral+sizeSegment1;
72 maxSegment2 = iGeneral+sizeSegment1+sizeSegment2;
74 iSeg2 = iGeneral+sizeSegment1;
75 for (ii=0; ii<maxElements; ii++)
77 triangleStrip->GetPointIds()->SetId(ii*2 ,iSeg1);
78 triangleStrip->GetPointIds()->SetId(ii*2+1,iSeg2);
81 if (iSeg1>=maxSegment1) { iSeg1=maxSegment1-1; }
82 if (iSeg2>=maxSegment2) { iSeg2=maxSegment2-1; }
84 iGeneral=iGeneral+sizeSegment1;
85 cells->InsertNextCell(triangleStrip);
89 if(bbGetInputCloseSurface()){
90 //false = Open Contour
91 //true = Closed Contour
92 if(bbGetInputOpenClose()){
93 CloseContourSides(lstIndexs, true);
96 CloseOpenContourSurface(lstIndexs);
100 // vtkPolyData *polydata = vtkPolyData::New();
101 if (polydata!=NULL) polydata->Delete();
102 polydata = vtkPolyData::New();
103 polydata->SetPoints(points);
104 polydata->SetStrips(cells);
105 // vtkCleanPolyData *clean=vtkCleanPolyData::New();
106 if (clean!=NULL) clean->Delete();
107 clean = vtkCleanPolyData::New();
108 clean->SetInputData(polydata);
110 // vtkTriangleFilter *triangle = vtkTriangleFilter::New();
111 if (triangle!=NULL) triangle->Delete();
112 triangle = vtkTriangleFilter::New();
113 triangle->SetInputData( clean->GetOutput() );
115 bbSetOutputOut( triangle->GetOutput() );
116 // bbSetOutputOut( clean->GetOutput() );
118 //printf("PG CreateMeshFromPoints::Process: End\n");
122 * Closes the sides of the contour
123 * iterates in one way or the other, depending on the order of the points and calculated vectors.
124 * uPointOrder: Points are order in a U shape
125 * lstIndexs: number of points on each spline
127 void CreateMeshFromPoints::CloseContourSides(std::vector<int> lstIndexs, bool uPointOrder){
128 int sizeLstIdexes = lstIndexs.size();
129 int sizePoints = bbGetInputLstX().size();
131 int firstIndex, end, centroidId, numPointsFace, contraryId;
132 int increment = uPointOrder?1:sizeLstIdexes;
135 for(int facesIdx = 0; facesIdx < 2; facesIdx++){
136 std::fill(std::begin(centroid), std::end(centroid), 0);
139 numPointsFace = uPointOrder?lstIndexs[0]: sizeLstIdexes;
140 end = uPointOrder?firstIndex + numPointsFace:sizePoints - lstIndexs[sizeLstIdexes - 1] + 1;
141 contraryId = sizePoints-1;
144 firstIndex = uPointOrder?sizePoints - lstIndexs[sizeLstIdexes-1]:lstIndexs[0]-1;
145 numPointsFace = uPointOrder?lstIndexs[sizeLstIdexes-1]:sizeLstIdexes;
146 end = uPointOrder?firstIndex + numPointsFace:sizePoints;
149 if(numPointsFace > 1){
150 double lastPoint[3] = {};
151 bool validCentroid = CalcValidCentroid(centroid, firstIndex, end, increment, numPointsFace);
153 bool normalOrder = isPointingCorrectly(firstIndex, firstIndex+increment, centroid, contraryId);
154 centroidId = points->InsertNextPoint(centroid[0], centroid[1], centroid[2]);
155 vtkSmartPointer<vtkTriangleStrip> triangleStrip1 = vtkSmartPointer<vtkTriangleStrip>::New();
156 triangleStrip1->GetPointIds()->SetNumberOfIds(numPointsFace*2+1);
158 { //(facesIdx == 0 && uPointOrder) || (facesIdx == 1 && !uPointOrder)){
159 int initial = firstIndex;
160 int triangleIndex = 0;
161 for(int index = initial; index < end; index+=increment){
162 triangleStrip1->GetPointIds()->SetId(triangleIndex,index);
163 if(index+increment >= end){
164 triangleStrip1->GetPointIds()->SetId(triangleIndex+1,initial);
165 triangleStrip1->GetPointIds()->SetId(triangleIndex+2,centroidId);
168 triangleStrip1->GetPointIds()->SetId(triangleIndex+1,centroidId);
172 cells->InsertNextCell(triangleStrip1);
174 int initial = firstIndex-1;
175 int triangleIndex = 0;
176 int triangleStripStart = end-1;
177 for(int index = triangleStripStart; index > initial; index-=increment){
178 triangleStrip1->GetPointIds()->SetId(triangleIndex,index);
179 if(index-increment <= initial){
180 triangleStrip1->GetPointIds()->SetId(triangleIndex+1,triangleStripStart);
181 triangleStrip1->GetPointIds()->SetId(triangleIndex+2,centroidId);
184 triangleStrip1->GetPointIds()->SetId(triangleIndex+1,centroidId);
188 cells->InsertNextCell(triangleStrip1);
197 * Checks if the normal from firstPointId, secPointId and centroid points away
198 * from the vector centroid to contrPointId.
199 * Used to check that the order used to create the new polygons is correct.
201 bool CreateMeshFromPoints::isPointingCorrectly( int firstPointId, int secPointId, double(¢roid)[3], int contrPointId) {
203 double firstPoint[3], secPoint[3], contrPoint[3];
204 points->GetPoint(firstPointId, firstPoint);
205 points->GetPoint(secPointId, secPoint);
207 double firstVect[3], secVect[3], normal[3], contrVect[3];
209 vtkMath::Subtract(firstPoint, centroid, firstVect);
210 vtkMath::Subtract(secPoint, centroid, secVect);
212 points->GetPoint(contrPointId, contrPoint);
213 vtkMath::Subtract(contrPoint, centroid, contrVect);
215 vtkMath::Cross(firstVect, secVect, normal);
217 dotCalc = vtkMath::Dot(normal, contrVect);
223 * Checks if points on each side of the shapes represent a curve.
225 bool CreateMeshFromPoints::CheckLinePointOrder(){
226 int sizePoints = bbGetInputLstX().size();
227 std::vector<int> lstIndexs = bbGetInputLstIndexs();
228 double point1[3], point2[3], point3[3];
230 double firstRadiusSum = 0;
231 double secondRadiusSum = 0;
232 for(int i = 0; i < lstIndexs[0] && lstIndexs[0] > 3; i+=3){
233 if(i+3 <= lstIndexs[0]){
234 points->GetPoint(i, point1);
235 points->GetPoint(i+1, point2);
236 points->GetPoint(i+2, point3);
237 firstRadiusSum += vtkMath::Solve3PointCircle(point1, point2, point3, center);
241 for(int i = 0; i < sizePoints && lstIndexs.size() > 3; i+=(lstIndexs[0]*3)){
242 if(i+(3*lstIndexs[0]) <= sizePoints){
243 points->GetPoint(i, point1);
244 points->GetPoint(i+lstIndexs[0], point2);
245 points->GetPoint(i+(2*lstIndexs[0]), point3);
246 secondRadiusSum += vtkMath::Solve3PointCircle(point1, point2, point3, center);
250 return firstRadiusSum > secondRadiusSum;
254 * Closes an open contour
255 * lstIndexs: number of points on each spline
257 void CreateMeshFromPoints::CloseOpenContourSurface(std::vector<int> lstIndexs){
258 int sizeLstIdexes = lstIndexs.size();
259 int sizeLstX = bbGetInputLstX().size();
260 bool linePointOrder = CheckLinePointOrder();
261 CloseContourSides(lstIndexs, !linePointOrder);
262 CloseContourBottom(!linePointOrder);
266 * Calculates centroid.
267 * centroid: array to store calculation
268 * start: start index of points to use
269 * end: end index of points to use
270 * increment: increment to be used in point iteration
271 * numPoints: number of points used to calculate the centroid.
272 * Returns a bool indicating the validity of the centroid calculated.
273 * False = invalid centroid = all points are the same.
275 bool CreateMeshFromPoints::CalcValidCentroid(double(¢roid)[3], int start, int end, int increment, int numPoints){
276 double currPoint[3] = {}, prevPoint[3] = {};
277 bool samePoint = true;
278 for(int i = start; i < end; i+=increment){
279 points->GetPoint(i, currPoint);
280 if(samePoint && (currPoint[0] != prevPoint[0] || currPoint[1] != prevPoint[1] || currPoint[2] != prevPoint[2])){
283 centroid[0] += currPoint[0];
284 centroid[1] += currPoint[1];
285 centroid[2] += currPoint[2];
286 std::copy(std::begin(currPoint), std::end(currPoint), prevPoint);
288 centroid[0] /= numPoints;
289 centroid[1] /= numPoints;
290 centroid[2] /= numPoints;
296 * Closes the bottom of the given countour.
297 * Should only be used when its an open contour.
298 * uPointOrder: points are ordered in U shape
300 void CreateMeshFromPoints::CloseContourBottom(bool uPointOrder){
301 std::vector<int> lstIndexs = bbGetInputLstIndexs();
302 int sizeLstIdexes = lstIndexs.size();
303 int sizeLstX = bbGetInputLstX().size();
305 vtkSmartPointer<vtkTriangleStrip> triangleStripBottom = vtkSmartPointer<vtkTriangleStrip>::New();
306 triangleStripBottom->GetPointIds()->SetNumberOfIds(sizeLstIdexes*2);
307 int triangleIndex = 0, currentId = 0, nextId = 0;
308 for(int splineIndex = 0; splineIndex < sizeLstIdexes;splineIndex++){
309 triangleStripBottom->GetPointIds()->SetId(triangleIndex, currentId);
310 nextId = uPointOrder?currentId + lstIndexs[splineIndex] - 1:sizeLstX - sizeLstIdexes + splineIndex;
311 triangleStripBottom->GetPointIds()->SetId(triangleIndex+1, nextId);
313 currentId = uPointOrder?nextId + 1: splineIndex+1;
315 cells->InsertNextCell(triangleStripBottom);
319 // Before editing this file, make sure it's a file of your own (i.e.: it wasn't generated from xml description; if so : your modifications will be lost)
321 void CreateMeshFromPoints::bbUserSetDefaultValues()
324 // SET HERE THE DEFAULT INPUT/OUTPUT VALUES OF YOUR BOX
325 // Here we initialize the input 'In' to 0
327 bbSetInputCloseSurface(false);
328 bbSetInputOpenClose(false);
336 // Before editing this file, make sure it's a file of your own (i.e.: it wasn't generated from xml description; if so : your modifications will be lost)
338 void CreateMeshFromPoints::bbUserInitializeProcessing()
341 // THE INITIALIZATION METHOD BODY :
343 // but this is where you should allocate the internal/output pointers
349 // Before editing this file, make sure it's a file of your own (i.e.: it wasn't generated from xml description; if so : your modifications will be lost)
351 void CreateMeshFromPoints::bbUserFinalizeProcessing()
354 // THE FINALIZATION METHOD BODY :
356 // but this is where you should desallocate the internal/output pointers
361 // EO namespace bbcreaVtk