bbtk_creaVtk_PKG/src/bbcreaVtkCreateMeshFromPoints.cxx

   1 //=====
   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)
   3 //=====
   4 #include "bbcreaVtkCreateMeshFromPoints.h"
   5 #include "bbcreaVtkPackage.h"
   6
   7 #include "vtkTriangleStrip.h"
   8 #include "vtkTriangle.h"
   9 #include <vtkMath.h>
  10
  11 namespace bbcreaVtk
  12 {
  13
  14 BBTK_ADD_BLACK_BOX_TO_PACKAGE(creaVtk,CreateMeshFromPoints)
  15 BBTK_BLACK_BOX_IMPLEMENTATION(CreateMeshFromPoints,bbtk::AtomicBlackBox);
  16 //=====
  17 // 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 //=====
  19 void CreateMeshFromPoints::Process()
  20 {
  21
  22 // THE MAIN PROCESSING METHOD BODY
  23 //   Here we simply set the input 'In' value to the output 'Out'
  24 //   And print out the output value
  25 // INPUT/OUTPUT ACCESSORS ARE OF THE FORM :
  26 //    void bbSet{Input|Output}NAME(const TYPE&)
  27 //    const TYPE& bbGet{Input|Output}NAME() const
  28 //    Where :
  29 //    * NAME is the name of the input/output
  30 //      (the one provided in the attribute 'name' of the tag 'input')
  31 //    * TYPE is the C++ type of the input/output
  32 //      (the one provided in the attribute 'type' of the tag 'input')
  33
  34 //    bbSetOutputOut( bbGetInputIn() );
  35 //    std::cout << "Output value = " <<bbGetOutputOut() << std::endl;
  36
  37                 std::vector<double> lstX                = bbGetInputLstX();
  38                 std::vector<double> lstY                = bbGetInputLstY();
  39                 std::vector<double> lstZ                = bbGetInputLstZ();
  40                 std::vector<int> lstIndexs              = bbGetInputLstIndexs();
  41                 double pointsCentroid[3];
  42                 if ( (lstIndexs.size()<1) || (lstX.size()==0) || (lstX.size()!=lstY.size()) || (lstY.size()!=lstZ.size()) )
  43                 {
  44                         printf("Warning! CreateMeshFromPoints::Process: List of points X Y Z  and LstIndexes is not correct\n");
  45                         bbSetOutputOut(NULL);
  46                 } else  {
  47                         int ii,sizeSegment1,sizeSegment2;
  48                         int endSegment;
  49 //                      vtkSmartPointer<vtkPoints> points = vtkSmartPointer<vtkPoints>::New();
  50                         if (points!=NULL) points->Delete();
  51                         points = vtkPoints::New();
  52                         int i,sizeLstX  =       lstX.size();
  53                         for (i=0;i<sizeLstX;i++)
  54                         {
  55                                 points->InsertNextPoint(lstX[i],lstY[i],lstZ[i]);
  56                                 pointsCentroid[0] += lstX[i];
  57                                 pointsCentroid[1] += lstY[i];
  58                                 pointsCentroid[2] += lstZ[i];
  59                         } // for i
  60                         pointsCentroid[0] /= sizeLstX;
  61                         pointsCentroid[1] /= sizeLstX;
  62                         pointsCentroid[2] /= sizeLstX;
  63
  64                         if(bbGetInputCloseSurface())
  65                         {
  66                                 //Correct surface normals if needed
  67                                 double pointSurf1[3], pointSurf2[3], pointSurf3[3];
  68                                 double vect1[3], vect2[3];
  69                                 double surfNormal[3], vectorCenter[3];
  70                                 double dotNormalSurf = 0;
  71
  72                                 for(int pIndex = 0; pIndex < lstIndexs[0]-1; pIndex++){
  73                                         pointSurf1[0] = lstX[pIndex];
  74                                         pointSurf1[1] = lstY[pIndex];
  75                                         pointSurf1[2] = lstZ[pIndex];
  76                                         vtkMath::Subtract(pointsCentroid, pointSurf1, vectorCenter);
  77
  78                                         pointSurf2[0] = lstX[pIndex+lstIndexs[1]];
  79                                         pointSurf2[1] = lstY[pIndex+lstIndexs[1]];
  80                                         pointSurf2[2] = lstZ[pIndex+lstIndexs[1]];
  81                                         pointSurf3[0] = lstX[pIndex+1];
  82                                         pointSurf3[1] = lstY[pIndex+1];
  83                                         pointSurf3[2] = lstZ[pIndex+1];
  84                                         vtkMath::Subtract(pointSurf2, pointSurf1, vect1);
  85                                         vtkMath::Subtract(pointSurf3, pointSurf1, vect2);
  86                                         vtkMath::Cross(vect1, vect2, surfNormal);
  87                                         dotNormalSurf += vtkMath::Dot(surfNormal, vectorCenter);
  88                                 }
  89                                 if(dotNormalSurf > 0){
  90                                         points->Delete();
  91                                         points = vtkPoints::New();
  92                                         for(int splineI = 0; splineI < lstIndexs.size(); splineI++){
  93                                                 for (i=lstIndexs[splineI]-1; i >= 0;i--)
  94                                                 {
  95                                                         points->InsertNextPoint(lstX[splineI*lstIndexs[0]+i],lstY[splineI*lstIndexs[0]+i],lstZ[splineI*lstIndexs[0]+i]);
  96                                                 }
  97                                         }
  98                                 }
  99                         }
 100                         //
 101
 102 //                      vtkSmartPointer<vtkCellArray> cells = vtkSmartPointer<vtkCellArray>::New();
 103                         if (cells!=NULL) cells->Delete();
 104                         cells = vtkCellArray::New();
 105                         int maxElements;
 106                         int maxSegment1,maxSegment2;
 107                         int iSeg1,iSeg2;
 108                         int iGeneral    =       0;
 109                         int     sizeLstIdexes=lstIndexs.size();
 110                         for (i=0; i<sizeLstIdexes-1; i++ )
 111                         {
 112                                 sizeSegment1 = lstIndexs[i];
 113                                 sizeSegment2 = lstIndexs[i+1];
 114                                 vtkSmartPointer<vtkTriangleStrip> triangleStrip = vtkSmartPointer<vtkTriangleStrip>::New();
 115                                 triangleStrip->GetPointIds()->SetNumberOfIds(sizeSegment1+sizeSegment2);
 116                                 maxElements=sizeSegment1;
 117                                 if (maxElements<sizeSegment2) maxElements=sizeSegment2;
 118                                 maxSegment1     = iGeneral+sizeSegment1;
 119                                 maxSegment2     = iGeneral+sizeSegment1+sizeSegment2;
 120                                 iSeg1           = iGeneral;
 121                                 iSeg2           = iGeneral+sizeSegment1;
 122                                 for (ii=0; ii<maxElements; ii++)
 123                                 {
 124                                         triangleStrip->GetPointIds()->SetId(ii*2  ,iSeg1);
 125                                         triangleStrip->GetPointIds()->SetId(ii*2+1,iSeg2);
 126                                         iSeg1++;
 127                                         iSeg2++;
 128                         if (iSeg1>=maxSegment1) { iSeg1=maxSegment1-1; }
 129                         if (iSeg2>=maxSegment2) { iSeg2=maxSegment2-1; }
 130                                 } // for ii
 131                                 iGeneral=iGeneral+sizeSegment1;
 132                                 cells->InsertNextCell(triangleStrip);
 133                         } //for  LstIndexs
 134
 135
 136                         if(bbGetInputCloseSurface())
 137                         {
 138                                 int lastId1 = lstIndexs[0]-1;
 139                                 int lastId2 = sizeLstX - 1;
 140                                 int firstId2 = sizeLstX - lstIndexs[sizeLstIdexes - 1];
 141                                 bool face1open = std::fabs(lstX[0] - lstX[lastId1]) > 0.0001 && std::fabs(lstY[0] - lstY[lastId1]) > 0.0001 && std::fabs(lstZ[0] - lstZ[lastId1]) > 0.0001;
 142                                 bool face2open = std::fabs(lstX[firstId2] - lstX[lastId2]) > 0.0001 && std::fabs(lstY[firstId2] - lstY[lastId2]) > 0.0001 && std::fabs(lstZ[firstId2] - lstZ[lastId2]) > 0.0001;
 143
 144                                 bool altFace1open = std::fabs(lstX[0] - lstX[firstId2]) > 0.0001 && std::fabs(lstY[0] - lstY[firstId2]) > 0.0001 && std::fabs(lstZ[0] - lstZ[firstId2]) > 0.0001;
 145                                 bool altFace2open = std::fabs(lstX[lastId1] - lstX[lastId2]) > 0.0001 && std::fabs(lstY[lastId1] - lstY[lastId2]) > 0.0001 && std::fabs(lstZ[lastId1] - lstZ[lastId2]) > 0.0001;
 146
 147                                 //false = Open Contour
 148                                 //true = Closed Contour
 149                                 if(!face1open && !face2open)
 150                                 {
 151 //                                      isClosedCont = true;
 152                                         CloseContourSides(lstIndexs, true, true);
 153                                 }
 154                                 else if(!altFace1open && !altFace2open)
 155                                 {
 156 //                                      isClosedCont = true;
 157                                         CloseContourSides(lstIndexs, false, true);
 158                                 }
 159                                 else{
 160                                         CloseOpenContourSurface(lstIndexs);
 161                                 }
 162                         }
 163
 164 //                      vtkPolyData *polydata = vtkPolyData::New();
 165                         if (polydata!=NULL) polydata->Delete();
 166                         polydata = vtkPolyData::New();
 167                         polydata->SetPoints(points);
 168                         polydata->SetStrips(cells);
 169 //                      vtkCleanPolyData *clean=vtkCleanPolyData::New();
 170                         if (clean!=NULL) clean->Delete();
 171                         clean = vtkCleanPolyData::New();
 172                         clean->SetInputData(polydata);
 173                         clean->Update();
 174 //                      vtkTriangleFilter *triangle = vtkTriangleFilter::New();
 175                         if (triangle!=NULL) triangle->Delete();
 176                         triangle = vtkTriangleFilter::New();
 177                         triangle->SetInputData( clean->GetOutput() );
 178                         triangle->Update();
 179             bbSetOutputOut( triangle->GetOutput() );
 180             //            bbSetOutputOut( clean->GetOutput() );
 181                 }// if listXYZ size
 182                 //printf("PG CreateMeshFromPoints::Process: End\n");
 183 }
 184 /**
 185 * Closes the sides of the contour
 186 * iterates in one way or the other, depending on the order of the points and calculated vectors.
 187 * uPointOrder: Points are order in a U shape
 188 * lstIndexs: number of points on each spline
 189 */
 190 void CreateMeshFromPoints::CloseContourSides(std::vector<int> lstIndexs, bool uPointOrder, bool isClosedCont){
 191         int     sizeLstIdexes = lstIndexs.size();
 192         int sizePoints = bbGetInputLstX().size();
 193
 194         int firstIndex, end, centroidId, numPointsFace, contraryId;
 195         int increment = uPointOrder?1:sizeLstIdexes;
 196         double centroid[3];
 197         int numProcessFaces = sizeLstIdexes > 1?2:1;
 198         for(int facesIdx = 0; facesIdx < numProcessFaces; facesIdx++){
 199                 std::fill(std::begin(centroid), std::end(centroid), 0);
 200                 if(facesIdx == 0)
 201                 {
 202                         firstIndex = 0;
 203                         numPointsFace = uPointOrder?lstIndexs[0]: sizeLstIdexes;
 204                         end = uPointOrder?firstIndex + numPointsFace:sizePoints - lstIndexs[sizeLstIdexes - 1] + 1;
 205                         contraryId = sizePoints-1;
 206                 }else{
 207                         firstIndex = uPointOrder?sizePoints - lstIndexs[sizeLstIdexes-1]:lstIndexs[0]-1;
 208                         numPointsFace = uPointOrder?lstIndexs[sizeLstIdexes-1]:sizeLstIdexes;
 209                         end = uPointOrder?firstIndex + numPointsFace:sizePoints;
 210                         contraryId = 0;
 211                 }
 212                 if(numPointsFace > 1)
 213                 {
 214                         bool validCentroid = CalcValidCentroid(centroid, firstIndex, end, increment, numPointsFace);
 215                         if(validCentroid)
 216                         {
 217                                 bool normalOrder    = isPointingCorrectly(firstIndex, firstIndex+increment, centroid, contraryId);
 218                                 centroidId          = points->InsertNextPoint(centroid[0], centroid[1], centroid[2]);
 219                                 //vtkSmartPointer<vtkTriangleStrip> triangleStrip = vtkSmartPointer<vtkTriangleStrip>::New();
 220                                 //triangleStrip->GetPointIds()->SetNumberOfIds(numPointsFace*2 + (!isClosedCont?2:0));
 221                                 //int triangleIndex = 0;
 222                                 if( normalOrder )
 223                 {
 224                         int initial = firstIndex;
 225                         for(int index = initial; index < end; index+=increment){
 226                                                 if(index+increment >= end && !isClosedCont){
 227                                                         vtkNew<vtkTriangle> triangle;
 228                                                         triangle->GetPointIds()->SetId(0, index);
 229                                                         triangle->GetPointIds()->SetId(1, initial);
 230                                                         triangle->GetPointIds()->SetId(2, centroidId);
 231                                                         cells->InsertNextCell(triangle);
 232                                                 }else if(index+increment < end){
 233                                                         vtkNew<vtkTriangle> triangle;
 234                                                         triangle->GetPointIds()->SetId(0, index);
 235                                                         triangle->GetPointIds()->SetId(1, index+increment);
 236                                                         triangle->GetPointIds()->SetId(2, centroidId);
 237                                                         cells->InsertNextCell(triangle);
 238                                                 }
 239                                                 /*
 240                                                 triangleStrip->GetPointIds()->SetId(triangleIndex,index);
 241                                                 triangleStrip->GetPointIds()->SetId(triangleIndex+1,centroidId);//1
 242                                                 if(index+increment >= end && !isClosedCont){
 243                                                         triangleStrip->GetPointIds()->SetId(triangleIndex+2,initial);//2
 244                                                         triangleStrip->GetPointIds()->SetId(triangleIndex+3,centroidId);//3
 245                                                 }
 246                                                 triangleIndex+=2;
 247                                                 */
 248                                         }
 249                                         //cells->InsertNextCell(triangleStrip);
 250                                 } else {
 251                                         int initial = firstIndex-1;
 252                                         int triangleStripStart = end-1;
 253                                         for(int index = triangleStripStart; index > initial; index-=increment){
 254                                                 if(index-increment <= initial && !isClosedCont){
 255                                                         vtkNew<vtkTriangle> triangle;
 256                                                         triangle->GetPointIds()->SetId(0, index);
 257                                                         triangle->GetPointIds()->SetId(1, triangleStripStart);
 258                                                         triangle->GetPointIds()->SetId(2, centroidId);
 259                                                         cells->InsertNextCell(triangle);
 260                                                 }else if(index-increment > initial){
 261                                                         vtkNew<vtkTriangle> triangle;
 262                                                         triangle->GetPointIds()->SetId(0, index);
 263                                                         triangle->GetPointIds()->SetId(1, index-increment);
 264                                                         triangle->GetPointIds()->SetId(2, centroidId);
 265                                                         cells->InsertNextCell(triangle);
 266                                                 }
 267                                         }
 268                                 }//if normalOrder
 269                         }//if validCentroid
 270                 }//if numPointsFace
 271         }//for facesIdx
 272
 273 }
 274
 275 /**
 276 * Checks if the normal from firstPointId, secPointId and centroid points away
 277 * from the vector centroid to contrPointId.
 278 * Used to check that the order used to create the new polygons is correct.
 279 */
 280 bool CreateMeshFromPoints::isPointingCorrectly( int firstPointId, int secPointId, double(&centroid)[3], int contrPointId) {
 281
 282         double firstPoint[3], secPoint[3], contrPoint[3];
 283         points->GetPoint(firstPointId, firstPoint);
 284         points->GetPoint(secPointId, secPoint);
 285
 286         double firstVect[3], secVect[3], normal[3], contrVect[3];
 287
 288         vtkMath::Subtract(firstPoint, centroid, firstVect);
 289         vtkMath::Subtract(secPoint, centroid, secVect);
 290
 291         points->GetPoint(contrPointId, contrPoint);
 292         vtkMath::Subtract(contrPoint, centroid, contrVect);
 293
 294         vtkMath::Cross(firstVect, secVect, normal);
 295         double dotCalc;
 296         dotCalc = vtkMath::Dot(normal, contrVect);
 297
 298         return dotCalc<0;
 299 }
 300
 301 /**
 302 * Checks if the order of the points represent a curved spline (U shape) or the points resemble a straight spline.
 303 * Now it checks the angle between each point and the vector that goes from the last point to the first.
 304 *
 305 * Previous version checked the curvature between 3 points in the spline, but this created problems when the straight lines
 306 * had curves in the middle, increasing the curvature although they are not in the U shape.
 307 */
 308 bool CreateMeshFromPoints::CheckLinePointOrder(){
 309         int sizePoints = bbGetInputLstX().size();
 310         std::vector<int> lstIndexs = bbGetInputLstIndexs();
 311         double point1[3], point2[3], point3[3];
 312         double center[3];
 313         double firstAngleSum = 0;
 314         double secondAngleSum = 0;
 315
 316         points->GetPoint(0, point1);
 317         points->GetPoint((lstIndexs[0]-1), point3);
 318         double firstVect[3];
 319         double secVect[3];
 320         vtkMath::Subtract(point3, point1, firstVect);
 321         for(int i = 0; i < lstIndexs[0]; i++){
 322                 points->GetPoint(i, point2);
 323                 vtkMath::Subtract(point2, point1, secVect);
 324                 firstAngleSum += vtkMath::SignedAngleBetweenVectors(firstVect, secVect, firstVect);
 325         }
 326         points->GetPoint((sizePoints-lstIndexs[0]), point3);
 327         vtkMath::Subtract(point3, point1, firstVect);
 328         for(int i = 0; i < sizePoints; i+=lstIndexs.size()){
 329                 points->GetPoint(i, point2);
 330                 vtkMath::Subtract(point2, point1, secVect);
 331                 secondAngleSum += vtkMath::SignedAngleBetweenVectors(firstVect, secVect, firstVect);
 332         }
 333
 334         return firstAngleSum < secondAngleSum;
 335 }
 336
 337 /**
 338 * Closes an open contour
 339 * lstIndexs: number of points on each spline
 340 */
 341 void CreateMeshFromPoints::CloseOpenContourSurface(std::vector<int> lstIndexs){
 342         bool linePointOrder = CheckLinePointOrder();
 343         CloseContourSides(lstIndexs, !linePointOrder, false);
 344         CloseContourBottom(!linePointOrder);
 345 }
 346
 347 /**
 348 * Calculates centroid and checks if points are collinear.
 349 * centroid: array to store calculation
 350 * start: start index of points to use
 351 * end: end index of points to use
 352 * increment: increment to be used in point iteration
 353 * numPoints: number of points used to calculate the centroid.
 354 * Returns a bool indicating the validity of the centroid calculated.
 355 * False = invalid centroid = all points are the same.
 356 */
 357 bool CreateMeshFromPoints::CalcValidCentroid(double(&centroid)[3], int start, int end, int increment, int numPoints){
 358         double currPoint[3] = {}, prevPoint[3] = {}, middlePoint[3] = {}, firstPoint[3] = {};
 359         double vector1[3], vector2[3];
 360         bool samePoint = true;
 361         int splineMidPoint = numPoints/2;
 362         bool collinear = true;
 363
 364         points->GetPoint(start, firstPoint);
 365         points->GetPoint(splineMidPoint, middlePoint);
 366         vtkMath::Subtract(middlePoint, firstPoint, vector1);
 367
 368         for(int i = start; i < end; i+=increment){
 369                 points->GetPoint(i, currPoint);
 370                 if(samePoint && i > start && (currPoint[0] != prevPoint[0] || currPoint[1] != prevPoint[1] || currPoint[2] != prevPoint[2])){
 371                         samePoint = false;
 372                 }
 373
 374                 vtkMath::Subtract(currPoint, firstPoint, vector2);
 375                 double angle = vtkMath::AngleBetweenVectors(vector1, vector2);
 376                 if(angle > 0.0001 && collinear){
 377                         collinear = false;
 378                 }
 379
 380                 centroid[0] += currPoint[0];
 381                 centroid[1] += currPoint[1];
 382                 centroid[2] += currPoint[2];
 383                 std::copy(std::begin(currPoint), std::end(currPoint), prevPoint);
 384         }
 385
 386         centroid[0] /= numPoints;
 387         centroid[1] /= numPoints;
 388         centroid[2] /= numPoints;
 389
 390         return !samePoint && !collinear;
 391 }
 392
 393 /**
 394 * Closes the bottom of the given countour.
 395 * Should only be used when its an open contour.
 396 * uPointOrder: points are ordered in U shape
 397 */
 398 void CreateMeshFromPoints::CloseContourBottom(bool uPointOrder){
 399         std::vector<int> lstIndexs = bbGetInputLstIndexs();
 400         int sizeLstIdexes = lstIndexs.size();
 401         int sizeLstX = bbGetInputLstX().size();
 402
 403         vtkSmartPointer<vtkTriangleStrip> triangleStripBottom = vtkSmartPointer<vtkTriangleStrip>::New();
 404         triangleStripBottom->GetPointIds()->SetNumberOfIds(sizeLstIdexes*2);
 405
 406         double originPoint[3];
 407         points->GetPoint(0, originPoint);
 408         int middleMeshPoint = uPointOrder?lstIndexs[0]/2:lstIndexs[0]*sizeLstIdexes/2;
 409
 410         bool normalOrder = isPointingCorrectly(uPointOrder?lstIndexs[0]-1:sizeLstX-lstIndexs[0], uPointOrder?lstIndexs[0]:1, originPoint, middleMeshPoint);
 411
 412         int triangleIndex = 0, currentId = 0, nextId = 0;
 413         for(int splineIndex = 0; splineIndex < sizeLstIdexes;splineIndex++){
 414                 nextId = uPointOrder?currentId + lstIndexs[splineIndex] - 1:sizeLstX - sizeLstIdexes + splineIndex;
 415                 if(normalOrder)
 416                 {
 417                         triangleStripBottom->GetPointIds()->SetId(triangleIndex, currentId);
 418                         triangleStripBottom->GetPointIds()->SetId(triangleIndex+1, nextId);
 419                 }
 420                 else{
 421                         triangleStripBottom->GetPointIds()->SetId(triangleIndex, nextId);
 422                         triangleStripBottom->GetPointIds()->SetId(triangleIndex+1, currentId);
 423                 }
 424                 currentId = uPointOrder?nextId + 1: splineIndex+1;
 425                 triangleIndex+=2;
 426         }
 427         cells->InsertNextCell(triangleStripBottom);
 428 }
 429
 430 //=====
 431 // 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)
 432 //=====
 433 void CreateMeshFromPoints::bbUserSetDefaultValues()
 434 {
 435
 436 //  SET HERE THE DEFAULT INPUT/OUTPUT VALUES OF YOUR BOX
 437 //    Here we initialize the input 'In' to 0
 438 //   bbSetInputIn(0);
 439         bbSetInputCloseSurface(false);
 440         points          = NULL;
 441         cells           = NULL;
 442         polydata        = NULL;
 443         clean           = NULL;
 444         triangle        = NULL;
 445 }
 446 //=====
 447 // 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)
 448 //=====
 449 void CreateMeshFromPoints::bbUserInitializeProcessing()
 450 {
 451
 452 //  THE INITIALIZATION METHOD BODY :
 453 //    Here does nothing
 454 //    but this is where you should allocate the internal/output pointers
 455 //    if any
 456
 457
 458 }
 459 //=====
 460 // 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)
 461 //=====
 462 void CreateMeshFromPoints::bbUserFinalizeProcessing()
 463 {
 464
 465 //  THE FINALIZATION METHOD BODY :
 466 //    Here does nothing
 467 //    but this is where you should desallocate the internal/output pointers
 468 //    if any
 469
 470 }
 471 }
 472 // EO namespace bbcreaVtk
 473
 474