Doc clean-up: remove \cgalModifXXX

Triangulation/doc/Triangulation/Concepts/TriangulationDSFullCell.h

@@ -3,7 +3,6 @@
 \ingroup PkgTriangulationsConcepts
 \cgalConcept
 
-\cgalModifBegin
 The concept `TriangulationDSFullCell` describes the requirements for the 
 full cell class of a `CGAL::Triangulation_data_structure`. It refines
 the concept `TriangulationDataStructure::FullCell`.
@@ -34,7 +33,6 @@ This <I>rebound</I> base class is the class
 that the `CGAL::Triangulation_data_structure` 
 actually uses as a base class for the class 
 of `CGAL::Triangulation_data_structure::Vertex`.
-\cgalModifEnd
 
 \cgalRefines `TriangulationDataStructure::FullCell`
 
@@ -54,11 +52,9 @@ public:
 /// @{
   
 /*!
-\cgalModifBegin
 The `Triangulation_data_structure` in which the `TriangulationDSFullCell` is
 defined/used.
 Must be a model of the `TriangulationDataStructure` concept.
-\cgalModifEnd
 */
 typedef unspecified_type Triangulation_data_structure;
 

Triangulation/doc/Triangulation/Concepts/TriangulationDSVertex.h

@@ -3,7 +3,6 @@
 \ingroup PkgTriangulationsConcepts
 \cgalConcept
 
-\cgalModifBegin
 The concept `TriangulationDSVertex` describes the requirements for the 
 vertex base class of a `CGAL::Triangulation_data_structure`. It refines
 the concept `TriangulationDataStructure::Vertex`.
@@ -34,7 +33,6 @@ This <I>rebound</I> base class is the class
 that the `CGAL::Triangulation_data_structure` 
 actually uses as a base class for the class 
 of `CGAL::Triangulation_data_structure::Vertex`.
-\cgalModifEnd
 
 \cgalRefines `TriangulationDataStructure::Vertex`
 
@@ -55,11 +53,9 @@ public:
   
 /*!
 
-\cgalModifBegin
 The `Triangulation_data_structure` in which the vertex is
 defined/used.
 Must be a model of the `TriangulationDataStructure` concept.
-\cgalModifEnd
 
 */
 typedef unspecified_type Triangulation_data_structure;

Triangulation/doc/Triangulation/Concepts/TriangulationDataStructure.h

@@ -653,14 +653,12 @@ std::ostream & operator<<(std::ostream & os, const TriangulationDataStructure
 \ingroup PkgTriangulationsConcepts
 \cgalConcept
 
-\cgalModifBegin
 The concept `TriangulationDataStructure::Vertex` describes the type used by a 
 `TriangulationDataStructure` to store the vertices. 
 
 It sets requirements of combinatorial nature
 only, as geometry is not concerned here. In particular, we only require that
 the vertex holds a handle to a full cell incident to it in the triangulation.
-\cgalModifEnd
 
 \cgalHasModel `CGAL::Triangulation_ds_vertex<TriangulationDataStructure>`
 \cgalHasModel `CGAL::Triangulation_vertex<TriangulationTraits, Data, TriangulationDSVertex>`
@@ -751,7 +749,6 @@ std::istream& operator>>(std::istream & is, Triangulation_ds_vertex<Triangulatio
 \ingroup PkgTriangulationsConcepts
 \cgalConcept
 
-\cgalModifBegin
 The concept `TriangulationDataStructure::FullCell` describes the type used by a 
 `TriangulationDataStructure` to store the full cells. 
 
@@ -766,7 +763,6 @@ storing handles to the vertices of the
 full cell as well as handles to the adjacent full cells. Two full cells
 are said to be adjacent when they share a facet. Adjacent full cells are
 called hereafter neighbors.
-\cgalModifEnd
 
 \cgalHasModel `CGAL::Triangulation_ds_full_cell<TriangulationDataStructure,DSFullCellStoragePolicy>`
 \cgalHasModel `CGAL::Triangulation_full_cell<TriangulationTraits, Data, TriangulationDSFullCell>`

Triangulation/doc/Triangulation/Triangulation.txt

@@ -67,7 +67,6 @@ class are not embedded in Euclidean space but are only of combinatorial
 nature. It deals with simplicial complexes 
 which are pure, connected and without boundaries nor singularities. 
 
-\cgalModifBegin
 The class `CGAL::Triangulation<TriangulationTraits, TriangulationDataStructure>` 
 describes an embedded triangulation that has as vertices a given set of points.
 Methods are provided for the insertion of points in the triangulation, the
@@ -300,7 +299,6 @@ simplices incident to boundary faces of the convex hull.
 Each infinite \f$ i\f$-simplex is 
 incident to the infinite vertex and to an \f$ (i-1)\f$-simplex of the 
 convex hull boundary.
-\cgalModifEnd
 
 See Chapters \ref Chapter_2D_Triangulations "2D Triangulations" and 
 \ref Chapter_3D_Triangulations "3D Triangulations" for more details