Fixing typo in the 3D viewer documentation (#1831)

* Fixing typo in 3D viewer doc

* Fixing typo in 3D viewer doc (changelog)

Author: dcoeurjo

ChangeLog.md

@@ -5,6 +5,11 @@
 - *Documentation*
   - Many typos fixed in documentation using Github Copilot. (David Coeurjolly, [#1829](https://github.com/DGtal-team/DGtal/pull/1829))
 
+## BugFixes
+
+- *IO*
+  - Fixing typo in the 3d viewer documentation (David Coeurjolly, [#1831](https://github.com/DGtal-team/DGtal/pull/1831))
+
 # DGtal 2.1.0
 
 ## New features

README.md

@@ -44,11 +44,11 @@ A Docker file is included in the repository in order to allow the users to build
 To build the Docker image, Docker should have been installed in the system (to [install Docker](https://docs.docker.com/engine/install/)) download the *Dockerfile* inside the [DGtal repository](https://github.com/DGtal-team/DGtal), in the same directory where the Dockerfile is located execute    
 
 ```shell
-docker build -t dgtal:lastest .
+docker build -t dgtal:latest .
 ```
 To run an interactive terminal inside the docker container and see the examples 
 ```shell
-docker run -it --user=digital dgtal:lastest bash
+docker run -it --user=digital dgtal:latest bash
 cd /home/digital/git/DGtal/build/examples
 ```
 

src/DGtal/geometry/curves/GreedySegmentation.h

@@ -124,7 +124,7 @@ namespace DGtal
    * in the wider range [curve.begin(), curve.end()). 
    *
    * Moreover, a part of a digital curve may be processed either
-   * as an independant (open) digital curve or as a part whose 
+   * as an independent (open) digital curve or as a part whose 
    * segmentation at the ends depends of the underlying digital 
    * curve. That's why 3 processing modes are available:
    * - "Truncate" (default), the extension of the last segment 

src/DGtal/geometry/doc/moduleGridCurveAnalysis.dox

@@ -224,7 +224,7 @@ must be constructed from the same input parameters
 so that they can detect segments of the same class. 
 
 These methods are useful in segmentation algorithms when 
-new segment computers must be created. An independant factory 
+new segment computers must be created. An independent factory 
 is not required since a segment computer is a factory 
 for instances of its own type.  
 
@@ -477,7 +477,7 @@ Obviously, [beginIt, endIt) has to be a valid range included
 in the wider range [curve.begin(), curve.end()). 
 
 Moreover, a part of a digital curve may be processed either
-as an independant (open) digital curve or as a part whose 
+as an independent (open) digital curve or as a part whose 
 segmentation at the ends depends of the underlying digital 
 curve. That's why 3 processing modes are available:
 - "Truncate" (default), the extension of the last segment 

src/DGtal/geometry/tools/AffineGeometry.h

@@ -662,7 +662,7 @@ namespace DGtal
       // If basis has already d independent vectors, then there is no
       // other independent vector.
       if ( basis.size() >= dimension ) return Point::zero;
-      // At least one trivial canonic vector should be independant.
+      // At least one trivial canonic vector should be independent.
       Dimension k = 0;
       for ( ; k < dimension; k++ )
         {
@@ -698,7 +698,7 @@ namespace DGtal
       // If basis has already d independent vectors, then there is no
       // other independent vector.
       if ( basis.size() >= dimension ) return TOtherPoint::zero;
-      // At least one trivial canonic vector should be independant.
+      // At least one trivial canonic vector should be independent.
       Dimension k = 0;
       for ( ; k < dimension; k++ )
         {

src/DGtal/graph/DistanceBreadthFirstVisitor.h

@@ -439,7 +439,7 @@ while ( ! visitor.finished() )
     /**
        Push backs some node in the queue. The node should have been
        ignored previously at some point. Useful when the distance is
-       not truely a distance function.
+       not truly a distance function.
        @param node a pair Vertex, distance.
      */
     void pushAgain( const Node & node );

src/DGtal/images/ArrayImageAdapter.h

@@ -189,7 +189,7 @@ namespace DGtal
        *
        * The full domain will be the same as the copied ArrayImageAdapter. Only the viewable domain will be modified.
        *
-       * @warning Since this class in only a view on a independant storage, it does a shallow copy.
+       * @warning Since this class in only a view on a independent storage, it does a shallow copy.
        *
        * @param other         An another ArrayImageAdapter instance.
        * @param aViewDomain   A new viewable domain for this image.

src/DGtal/io/doc/moduleDisplay3D.dox

@@ -45,7 +45,7 @@ The library handles 3D scenes movement and allows to attributes of displayed obj
 First to use the PolyscopeViewer stream, you need to include the following headers:
  *
 @code
- #include "DGtal/io/3dViewers/PolyscopeViewer.h"
+ #include "DGtal/io/viewers/PolyscopeViewer.h"
 @endcode
  *
 The following code snippet defines three points and a rectangular

src/DGtal/io/doc/moduleIO.dox

@@ -104,7 +104,7 @@ Hence, for image writers,  some  functors may return a DGtal::Color or a scalar
 |            | Raw     | raw binary file format for any type | the functor should return the same type as specified in the template parameter of RawWriter::exportRaw | RawWriter     |                                                          |
 
 
-@note Since DGtal doesn't integrate ITK by default, ITK image should by writen directly using the ITKWriter class.
+@note Since DGtal doesn't integrate ITK by default, ITK image should be written directly using the ITKWriter class.
 @code
   Image image;
   DGtal::ITKReader<Image>::exportITK("example.mha", image);

src/DGtal/kernel/domains/Linearizer.h

@@ -19,7 +19,7 @@
 /**
  * @file Linearizer.h
  * @author Roland Denis (\c roland.denis@univ-smb.fr )
- * LAboratory of MAthematics - LAMA (CNRS, UMR 5127), University of Savoie, France
+ * Laboratory of Mathematics - LAMA (CNRS, UMR 5127), University of Savoie, France
  *
  * @date 2015/06/18
  *
@@ -82,7 +82,7 @@ namespace DGtal
    *
    * This is a static class that provides point linearization (point to index) and de-linearization (index to point) for storages working on HyperRectDomain.
    *
-   * The storage order can be specified by template (default is colum-major ordered).
+   * The storage order can be specified by template (default is column-major ordered).
    *
    * Example:
    * @code