Merge pull request #828 from afabri/Triangulation-more_typos-GF

Fix typos and add a dependency

Triangulation/doc/Triangulation/Concepts/TriangulationDataStructure.h

@@ -316,18 +316,14 @@ Vertex_handle vertex(Full_cell_handle c, const int i) const;
 
 /*!
 Returns the index of `c` as a neighbor of its `i`-th neighbor.
-\pre \f$0 \leq i \leq \f$`tds`.`current_dimension`()
+\pre \f$0 \leq i \leq \f$`tds`.`current_dimension`() and `c!=Full_cell_handle()`.
-
-and `c!=Full_cell_handle()`.
 */
 int mirror_index(Full_cell_handle c, int i) const;
 
 /*!
 Returns the vertex of the `i`-th neighbor of `c`
 that is not vertex of `c`.
-\pre \f$0 \leq i \leq \f$`tds`.`current_dimension`()
+\pre \f$0 \leq i \leq \f$`tds`.`current_dimension`() and `c!=Full_cell_handle()`.
-
-and `c!=Full_cell_handle()`.
 */
 Vertex_handle mirror_vertex(Full_cell_handle c, int i) const;
 
@@ -357,9 +353,7 @@ Full_cell_handle full_cell(Vertex_handle v) const;
 /*!
 Returns a `Full_cell_handle` pointing to the `Full_cell`
 opposite to the `i`-th vertex of `c`.
-\pre \f$0 \leq i \leq \f$`tds`.`current_dimension()`
+\pre \f$0 \leq i \leq \f$`tds`.`current_dimension()` and `c != Full_cell_handle()`
-
-and `c != Full_cell_handle()`
 */
 Full_cell_handle neighbor(Full_cell_handle c, int i) const;
 
@@ -415,8 +409,7 @@ share the vertex `v`.
 Insertion in a full cell, \f$ d=2\f$
 \cgalFigureEnd
 
-\pre Current dimension is positive and `c` is a full cell of
+\pre Current dimension is positive and `c` is a full cell of `tds`.
-`tds`.
 */
 Vertex_handle insert_in_full_cell(Full_cell_handle c);
 
@@ -1019,4 +1012,4 @@ std::istream& operator>>(std::istream & is, Triangulation_ds_full_cell<Triangula
 
 /// @}
 
-}; /* end TriangulationDataStructure::Vertex */
+}; /* end TriangulationDataStructure::Vertex */

Triangulation/doc/Triangulation/PackageDescription.txt

@@ -73,8 +73,8 @@ is opposite to the vertex with the same index.
 ## Triangulation Data Structure ##
 
 - `TriangulationDataStructure`
-- `TriangulationDataStructure_2::FullCell`
+- `TriangulationDataStructure::FullCell`
-- `TriangulationDataStructure_2::Vertex`
+- `TriangulationDataStructure::Vertex`
 - `TriangulationDSVertex`
 - `TriangulationDSFullCell`
 - `TriangulationDSFace`

Triangulation/doc/Triangulation/Triangulation.txt

@@ -21,10 +21,9 @@ sets of points.
 ## Some Definitions ##
 
 A <I>finite abstract simplicial complex</I> is built on a finite set of
-vertices \f$ V\f$ and consists of a collection \f$ S\f$ of subsets of \f$ V\f$ such that
+vertices \f$ V\f$ and consists of a collection \f$ S\f$ of subsets of \f$ V\f$ such that,
-
+if \f$ s\f$ is a set of vertices in \f$ S\f$, then all the subsets of \f$ s\f$ are also
-<CENTER>if \f$ s\f$ is a set of vertices in \f$ S\f$, then all the subsets of \f$ s\f$ are also
+in \f$ S\f$.
-in \f$ S\f$.</CENTER>
 
 The sets in \f$ S\f$ (which are subsets of \f$ V\f$) are called
 <I>faces</I> or <I>simplices</I> (the

Triangulation/doc/Triangulation/dependencies

@@ -1,4 +1,5 @@
 Manual
+Kernel_23
 Kernel_d
 STL_Extension
 Algebraic_foundations