Misc. typo fixes

Found via `codespell`

Common/DataModel/vtkGenericCellTessellator.h

@@ -29,7 +29,7 @@
  * repeats until the error metric is satisfied.
  *
  * A significant issue addressed by this algorithm is to insure face
- * compatibility across neigboring cells. That is, diagonals due to face
+ * compatibility across neighboring cells. That is, diagonals due to face
  * triangulation must match to insure that the mesh is compatible. The
  * algorithm employs a precomputed table to accelerate the tessellation
  * process. The table was generated with the help of vtkOrderedTriangulator;

Common/DataModel/vtkSimpleCellTessellator.h

@@ -30,7 +30,7 @@
  * on edge subdivision it inherently avoid T-junctions.
  *
  * A significant issue addressed by this algorithm is to insure face
- * compatibility across neigboring cells. That is, diagonals due to face
+ * compatibility across neighboring cells. That is, diagonals due to face
  * triangulation must match to insure that the mesh is compatible. The
  * algorithm employs a precomputed table to accelerate the tessellation
  * process. The table was generated with the help of vtkOrderedTriangulator

Filters/Core/vtkDelaunay2D.cxx

@@ -1418,7 +1418,7 @@ void vtkDelaunay2D::FillPolygons(vtkCellArray *polys, int *triUse)
               triUse[neiId] = 0;
               nextFront->InsertNextId(neiId);
             }
-          }//mark all neigbors
+          }//mark all neighbors
         }//for all edges of cell
       } //all cells in front
 

Filters/Core/vtkVoronoi2D.h

@@ -51,7 +51,7 @@
  * with an initial Voronoi tile, which is simply the bounding box of the
  * point set. A locator is then used to identify nearby points: each neighbor
  * in turn generates a clipping line positioned halfway between the
- * generating point and the neigboring point, and orthogonal to the line
+ * generating point and the neighboring point, and orthogonal to the line
  * connecting them. Clips are readily performed by evaluationg the vertices
  * of the convex Voronoi tile as being on either side (inside,outside) of the
  * clip line. If two intersections of the Voronoi tile are found, the portion

Filters/Extraction/vtkExtractCellsByType.h

@@ -67,7 +67,7 @@ public:
 
   //@{
   /**
-   * Specify the cell types to extract. Any cells of the type specfied are
+   * Specify the cell types to extract. Any cells of the type specified are
    * extracted. Methods for clearing the set of cells, adding all cells, and
    * determining if a cell is in the set are also provided.
    */

Filters/General/vtkEdgePoints.cxx

@@ -117,7 +117,7 @@ int vtkEdgePoints::RequestData(
 
   // Traverse all edges. Since edges are not explicitly represented, use a
   // trick: traverse all cells and obtain cell edges and then cell edge
-  // neighbors. If cell id < all edge neigbors ids, then this edge has not
+  // neighbors. If cell id < all edge neighbors ids, then this edge has not
   // yet been visited and is processed.
   //
   int abort=0;

Filters/Geometry/vtkStructuredAMRGridConnectivity.cxx

@@ -898,7 +898,7 @@ vtkStructuredAMRGridConnectivity::TransferGhostDataFromNeighbors(
   // Sanity check
   assert("pre: gridID is out-of-bounds!" &&
        (gridID >= 0) && (gridID < static_cast<int>(this->NumberOfGrids)));
-  assert("pre: Neigbors is not propertly allocated" &&
+  assert("pre: Neighbors is not properly allocated" &&
        (this->NumberOfGrids==this->Neighbors.size() ) );
 
   this->CellCenteredDonorLevel.resize( this->NumberOfGrids );
@@ -1009,7 +1009,7 @@ vtkStructuredAMRGridConnectivity::ComputeNeighborSendAndRcvExtent(
   // Sanity check
   assert( "pre: gridID is out-of-bounds!" &&
           (gridID >= 0) && (gridID < static_cast<int>(this->NumberOfGrids)));
-  assert( "pre: Neigbors is not propertly allocated" &&
+  assert( "pre: Neighbors is not properly allocated" &&
           (this->NumberOfGrids==this->Neighbors.size() ) );
 
   int gridRealExtent[6];

Filters/Geometry/vtkStructuredAMRGridConnectivity.h

@@ -736,7 +736,7 @@ inline
 void vtkStructuredAMRGridConnectivity::SetRefinementRatioAtLevel(
     const int level, const int r)
 {
-  assert("pre: RefinementRatios vector is not propertly allocated" &&
+  assert("pre: RefinementRatios vector is not properly allocated" &&
          this->RefinementRatios.size()==this->NumberOfLevels);
   assert("pre: leve is out-of-bounds!" &&
          (level >= 0) &&
@@ -751,7 +751,7 @@ inline
 int vtkStructuredAMRGridConnectivity::GetRefinementRatioAtLevel(
       const int level)
 {
-  assert( "pre: RefinementRatios vector is not propertly allocated" &&
+  assert( "pre: RefinementRatios vector is not properly allocated" &&
           this->RefinementRatios.size()==this->NumberOfLevels);
   assert( "pre: leve is out-of-bounds!" &&
           (level >= 0) &&

Filters/Geometry/vtkStructuredGridConnectivity.cxx

@@ -1468,7 +1468,7 @@ void vtkStructuredGridConnectivity::TransferGhostDataFromNeighbors(
   // Sanity check
   assert( "pre: gridID is out-of-bounds!" &&
           (gridID >= 0) && (gridID < static_cast<int>(this->NumberOfGrids)));
-  assert( "pre: Neigbors is not propertly allocated" &&
+  assert( "pre: Neighbors is not properly allocated" &&
           (this->NumberOfGrids==this->Neighbors.size() ) );
 
   int NumNeis = static_cast<int>(this->Neighbors[ gridID ].size());
@@ -1579,7 +1579,7 @@ void vtkStructuredGridConnectivity::ComputeNeighborSendAndRcvExtent(
   // Sanity check
   assert( "pre: gridID is out-of-bounds!" &&
           (gridID >= 0) && (gridID < static_cast<int>(this->NumberOfGrids)));
-  assert( "pre: Neigbors is not propertly allocated" &&
+  assert( "pre: Neighbors is not properly allocated" &&
           (this->NumberOfGrids==this->Neighbors.size() ) );
 
   int myRealGridExtent[6];

Filters/Points/vtkConnectedPointsFilter.h

@@ -32,7 +32,7 @@
  * radius is defined in absolute terms.
  *
  * Other parameters are used to further qualify what it means to be a
- * neigboring point. For example, scalar range and/or point normals can be
+ * neighboring point. For example, scalar range and/or point normals can be
  * used to further constrain the neighborhood. Also the extraction mode
  * defines how the filter operates. By default, all regions are extracted but
  * it is possible to extract particular regions; the region closest to a seed

Filters/Points/vtkEllipsoidalGaussianKernel.h

@@ -32,7 +32,7 @@
  * where S is the local scalar value; E is a user-defined eccentricity factor
  * that controls the elliptical shape of the splat; z is the distance of the
  * current voxel sample point along the local normal N; and rxy is the
- * distance to neigbor point x in the direction prependicular to N.
+ * distance to neighbor point x in the direction prependicular to N.
  *
  * @warning
  * The weights are normalized so that SUM(Wi) = 1. If a neighbor point p

Imaging/Hybrid/vtkCheckerboardSplatter.h

@@ -143,7 +143,7 @@ public:
   /**
    * Control the footprint size of the splat in terms of propagation across a
    * voxel neighborhood. The Footprint value simply indicates the number of
-   * neigboring voxels in the i-j-k directions to extend the splat. A value
+   * neighboring voxels in the i-j-k directions to extend the splat. A value
    * of zero means that only the voxel containing the splat point is
    * affected. A value of one means the immediate neighbors touching the
    * affected voxel are affected as well. Larger numbers increase the splat

Rendering/ContextOpenGL2/vtkOpenGLContextDevice2D.h

@@ -195,7 +195,7 @@ public:
   /**
    * Compute the bounds of the supplied string while taking into account the
    * justification of the currently applied text property. Simple rotations
-   * (0, 90, 180, 270 degrees) are also propertly taken into account.
+   * (0, 90, 180, 270 degrees) are also properly taken into account.
    */
   void ComputeJustifiedStringBounds(const char* string, float bounds[4]) override;