From 19c075c4fe62f3f80e1ae655e9d61f0ad6e4dd10 Mon Sep 17 00:00:00 2001 From: Andreas Fabri Date: Thu, 25 Feb 2016 16:20:37 +0100 Subject: [PATCH 1/2] fix typos and add a dependency --- .../Concepts/TriangulationDataStructure.h | 17 +++++------------ .../doc/Triangulation/PackageDescription.txt | 4 ++-- Triangulation/doc/Triangulation/dependencies | 1 + 3 files changed, 8 insertions(+), 14 deletions(-) diff --git a/Triangulation/doc/Triangulation/Concepts/TriangulationDataStructure.h b/Triangulation/doc/Triangulation/Concepts/TriangulationDataStructure.h index ac2c83bc4f2..e9ad2bb1620 100644 --- a/Triangulation/doc/Triangulation/Concepts/TriangulationDataStructure.h +++ b/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`() - -and `c!=Full_cell_handle()`. +\pre \f$0 \leq i \leq \f$`tds`.`current_dimension`() 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`() - -and `c!=Full_cell_handle()`. +\pre \f$0 \leq i \leq \f$`tds`.`current_dimension`() 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()` - -and `c != Full_cell_handle()` +\pre \f$0 \leq i \leq \f$`tds`.`current_dimension()` 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 -`tds`. +\pre Current dimension is positive and `c` is a full cell of `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 Date: Thu, 25 Feb 2016 21:17:19 +0100 Subject: [PATCH 2/2] no
--- Triangulation/doc/Triangulation/Triangulation.txt | 7 +++---- 1 file changed, 3 insertions(+), 4 deletions(-) diff --git a/Triangulation/doc/Triangulation/Triangulation.txt b/Triangulation/doc/Triangulation/Triangulation.txt index 7e67474c3a4..627c49d5476 100644 --- a/Triangulation/doc/Triangulation/Triangulation.txt +++ b/Triangulation/doc/Triangulation/Triangulation.txt @@ -21,10 +21,9 @@ sets of points. ## Some Definitions ## A finite abstract simplicial complex 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 - -
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$.
+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 +in \f$ S\f$. The sets in \f$ S\f$ (which are subsets of \f$ V\f$) are called faces or simplices (the