src/vtkImplicitPolyData.cpp

   1 /*=========================================================================
   2
   3   Program:   Boolean
   4   Module:    $RCSfile: vtkImplicitPolyData.cpp,v $
   5   Language:  C++
   6   Date:      $Date: 2003/07/12 11:22:38 $
   7   Version:   $Revision: 1.1.1.1 $
   8
   9   Copyright (c) 2002 Denis Shamonin
  10   Section Computational Science
  11   University of Amsterdam
  12   Kruislaan 403, 1098 SJ Amsterdam
  13   the Netherlands
  14
  15   E-mail        : dshamoni@science.uva.nl
  16   URL           : http://www.science.uva.nl/~dshamoni/
  17
  18   All rights reserved.
  19
  20      This software is distributed WITHOUT ANY WARRANTY; without even
  21      the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
  22      PURPOSE.  See the above copyright notice for more information.
  23
  24 =========================================================================
  25 ToDo:
  26 -   Needs to be restructured in line with vtk principles of on demand
  27     execution. Eg BuildLinks and BuildLocator on first call to Evaluate*?.
  28     Handle input modification correctly etc.
  29 -   Drop internal triangle filter and just check cell type as encountered?.
  30 -   Get working with CellLocator. Currently crashes every time, although
  31     a large number of cells are located successfully. Too hard to debug,
  32     maybe try a tiny dataset.
  33
  34     PLEASE SEND ME YOUR UPDATES, BUG FIXES! at dshamoni@science.uva.nl
  35 =========================================================================*/
  36 //#include <stdafx.h>
  37 #include "vtkImplicitPolyData.h"
  38 #include "vtkPolygon.h"
  39
  40 // Constructor
  41 vtkImplicitPolyData::vtkImplicitPolyData()
  42 {
  43   this->NoGradient[0] = 0.0;
  44   this->NoGradient[1] = 0.0;
  45   this->NoGradient[2] = 1.0;
  46
  47   this->tri = NULL;
  48   this->input = NULL;
  49   this->locator = NULL;
  50   this->poly = vtkPolygon::New();
  51   this->cells = NULL;
  52   this->EvaluateBoundsSet=0;
  53   this->Tolerance = 10.0;
  54 }
  55
  56 void vtkImplicitPolyData::SetInput(vtkPolyData *input)
  57 {
  58   if( this->input != input )
  59     {
  60     vtkDebugMacro( <<" setting Input to " << (void *)input );
  61
  62     // use a tringle filter on the polydata input
  63     // this is done to filter out lines and vertices to leave only
  64     // polygons which are required by this algorithm for cell normals
  65     if( this->tri == NULL )
  66       {
  67       this->tri = vtkTriangleFilter::New();
  68       this->tri->PassVertsOff();
  69       this->tri->PassLinesOff();
  70       }
  71     this->tri->SetInput( input );
  72     this->tri->Update();
  73
  74     this->input = this->tri->GetOutput();
  75     this->input->BuildLinks();  // to enable calls to GetPointCells
  76     this->NoValue = this->input->GetLength();
  77
  78     if( this->locator != NULL ) this->locator->Delete();
  79     locator = PointLocator::New();
  80     this->locator->SetDataSet( this->input );
  81 //  if( this->EvaluateBoundsSet )     // experimental
  82 //  this->locator->SetEvaluateBounds( this->EvaluateBounds );
  83     this->locator->BuildLocator();
  84
  85     if( this->cells   != NULL ) this->cells->Delete();
  86     this->cells = vtkIdList::New();
  87     this->cells->SetNumberOfIds( this->input->GetNumberOfCells() );
  88
  89     this->poly = vtkPolygon::New();
  90     this->Modified();
  91     }
  92 }
  93
  94 // used to extend bounds of point locator
  95 void vtkImplicitPolyData::SetEvaluateBounds( double eBounds[6] )
  96 {
  97   int i;
  98   for( i=0; i<6; i++ )
  99     {
 100     this->EvaluateBounds[i] = eBounds[i];
 101     }
 102
 103   this->EvaluateBoundsSet = 1;
 104 }
 105
 106 unsigned long vtkImplicitPolyData::GetMTime()
 107 {
 108   unsigned long mTime=this->vtkImplicitFunction::GetMTime();
 109   unsigned long inputMTime;
 110
 111   if ( this->input != NULL )
 112     {
 113     this->input->Update ();
 114     inputMTime = this->input->GetMTime();
 115     mTime = ( inputMTime > mTime ? inputMTime : mTime );
 116     }
 117
 118   return mTime;
 119 }
 120
 121 // Destructor
 122 vtkImplicitPolyData::~vtkImplicitPolyData()
 123 {
 124   if( this->tri     != NULL ) this->tri->Delete();
 125   if( this->locator != NULL ) this->locator->Delete();
 126   if( this->poly    != NULL ) this->poly->Delete();
 127   if( this->cells   != NULL ) this->cells->Delete();
 128 }
 129
 130 // Evaluate for point x[3].
 131 // Method using combination of implicit planes
 132 double vtkImplicitPolyData::EvaluateFunction(double x[3])
 133 {
 134   // See if data set with polygons has been specified
 135   if( this->input == NULL || input->GetNumberOfCells() == 0 )
 136     {
 137     vtkErrorMacro(<<"No polygons to evaluate function!");
 138     return this->NoValue;
 139     }
 140
 141   int cellNum, pid;
 142   double dist;
 143   vtkCell *cell;
 144   double dot, ret=-VTK_LARGE_FLOAT, cNormal[3], closestPoint[3];
 145
 146   // get point id of closest point in data set according Tolerance
 147   pid = this->locator->FindClosestPointWithinRadius(Tolerance,x,dist);
 148   if(( pid != -1 ) && (dist < Tolerance))
 149     {
 150     this->input->GetPoint( pid, closestPoint );
 151
 152     // get cells it belongs to
 153     this->input->GetPointCells( pid, cells );
 154     // for each cell
 155     for( cellNum=0; cellNum<cells->GetNumberOfIds(); cellNum++ )
 156       {
 157       cell = this->input->GetCell( cells->GetId( cellNum ) );
 158
 159       // get cell normal
 160       poly->ComputeNormal( cell->GetPoints(), cNormal );
 161
 162       dot = ( cNormal[0]*(x[0]-closestPoint[0]) +
 163               cNormal[1]*(x[1]-closestPoint[1]) +
 164               cNormal[2]*(x[2]-closestPoint[2]) );
 165
 166       if( dot > ret ) ret = dot;
 167       }
 168     }
 169
 170   if( ret == -VTK_LARGE_FLOAT ) ret = NoValue;
 171   return ret;
 172 }
 173
 174 // Evaluate function gradient at point x[3].
 175 void vtkImplicitPolyData::EvaluateGradient( double x[3], double n[3] )
 176 {
 177   int i;
 178   // See if data set with polygons has been specified
 179   if( this->input == NULL || input->GetNumberOfCells() == 0 )
 180     {
 181     vtkErrorMacro(<<"No polygons to evaluate gradient!");
 182     for( i=0; i<3; i++ ) n[i] = this->NoGradient[i];
 183     return;
 184     }
 185
 186   int cellNum, pid;
 187   double dist;
 188   vtkCell *cell;
 189   double dot, ret=-VTK_LARGE_FLOAT, cNormal[3], closestPoint[3];
 190
 191   // get point id of closest point in data set according Tolerance
 192   pid = this->locator->FindClosestPointWithinRadius(Tolerance,x,dist);
 193   if(( pid != -1 ) && (dist < Tolerance))
 194     {
 195     this->input->GetPoint( pid, closestPoint );
 196
 197     // get cells it belongs to
 198     this->input->GetPointCells( pid, cells );
 199     // for each cell
 200     for( cellNum=0; cellNum<cells->GetNumberOfIds(); cellNum++ )
 201        {
 202        cell = this->input->GetCell( cells->GetId( cellNum ) );
 203
 204        // get cell normal
 205        poly->ComputeNormal( cell->GetPoints(), cNormal );
 206
 207        dot = ( cNormal[0]*(x[0]-closestPoint[0]) +
 208                cNormal[1]*(x[1]-closestPoint[1]) +
 209                cNormal[2]*(x[2]-closestPoint[2]) );
 210
 211        if( dot > ret )
 212          {
 213          for( i=0; i<3; i++ ) n[i] = cNormal[i];
 214          }
 215
 216         }
 217     }
 218
 219   if( ret == -VTK_LARGE_FLOAT )
 220     {
 221     for( i=0; i<3; i++ ) n[i] = this->NoGradient[i];
 222     }
 223 }
 224
 225 void vtkImplicitPolyData::PrintSelf(ostream& os, vtkIndent indent)
 226 {
 227   vtkImplicitFunction::PrintSelf(os,indent);
 228
 229   os << indent << "No polydata Value: " << this->NoValue << "\n";
 230   os << indent << "No polydata Gradient: (" << this->NoGradient[0] << ", "
 231      << this->NoGradient[1] << ", " << this->NoGradient[2] << ")\n";
 232
 233   if ( this->input )
 234     {
 235     os << indent << "Input : " << this->input << "\n";
 236     }
 237   else
 238     {
 239     os << indent << "Input : (none)\n";
 240     }
 241
 242   os << indent << "Tolerance: " << this->Tolerance << "\n";
 243 }