diff --git a/Documentation/doc/resources/1.8.14/BaseDoxyfile.in b/Documentation/doc/resources/1.8.14/BaseDoxyfile.in index 84998bfc789..56a2538e6dc 100644 --- a/Documentation/doc/resources/1.8.14/BaseDoxyfile.in +++ b/Documentation/doc/resources/1.8.14/BaseDoxyfile.in @@ -267,7 +267,6 @@ ALIASES = "sc{1}=\1 \endhtmlonly" \ "cgalAdvancedFunction=This is an advanced function." \ "cgalAdvancedClass=This is an advanced class." \ - "cgalAdvancedConcept=This is an advanced concept." \ "cgalRequiresCPP11=\warning This function requires a C++11 compiler." \ "cgalPkgPicture{1}=
^^ \image html \1 ^^
" \ "cgalPkgSummaryBegin=
" \ diff --git a/Inscribed_areas/doc/Inscribed_areas/Concepts/ExtremalPolygonTraits_2.h b/Inscribed_areas/doc/Inscribed_areas/Concepts/ExtremalPolygonTraits_2.h index baba356c1d9..90f9d20b401 100644 --- a/Inscribed_areas/doc/Inscribed_areas/Concepts/ExtremalPolygonTraits_2.h +++ b/Inscribed_areas/doc/Inscribed_areas/Concepts/ExtremalPolygonTraits_2.h @@ -1,13 +1,11 @@ /*! \ingroup PkgInscribedAreasConcepts -\cgalAdvancedConcept +\cgalConcept -\cgalAdvancedBegin The concept `ExtremalPolygonTraits_2` provides the types and operations needed to compute a maximal \f$ k\f$-gon that can be inscribed into a given convex polygon. -\cgalAdvancedEnd \note `ExtremalPolygonTraits_2::Less_xy_2` and `ExtremalPolygonTraits_2::Orientation_2` are used for (expensive) diff --git a/Linear_cell_complex/doc/Linear_cell_complex/Concepts/LinearCellComplex.h b/Linear_cell_complex/doc/Linear_cell_complex/Concepts/LinearCellComplex.h index 08e3654b6c4..7d8af522c44 100644 --- a/Linear_cell_complex/doc/Linear_cell_complex/Concepts/LinearCellComplex.h +++ b/Linear_cell_complex/doc/Linear_cell_complex/Concepts/LinearCellComplex.h @@ -1,6 +1,7 @@ /*! \ingroup PkgLinearCellComplexConcepts +\cgalConcept The concept `LinearCellComplex` represents a linear cell complex in dimension `d`, in an ambient space of dimension `d2`. This is a model of the concept of `GenericMap` adding a requirement to ensure that each vertex of the map is associated with a model of `CellAttributeWithPoint`. diff --git a/Spatial_searching/doc/Spatial_searching/Concepts/SpatialSeparator.h b/Spatial_searching/doc/Spatial_searching/Concepts/SpatialSeparator.h index 52bf32c5272..3850557c7e2 100644 --- a/Spatial_searching/doc/Spatial_searching/Concepts/SpatialSeparator.h +++ b/Spatial_searching/doc/Spatial_searching/Concepts/SpatialSeparator.h @@ -5,13 +5,11 @@ The concept `SpatialSeparator` defines the requirements for a separator. -\cgalAdvancedBegin A separator is a `d-1`-dimensional subspace that separates a `d`-dimensional space into two parts. One part of space is said to be on the negative side of the separator and the other part of space is said to be on the positive side of the separator. -\cgalAdvancedEnd \cgalHasModel `CGAL::Plane_separator` diff --git a/Spatial_searching/doc/Spatial_searching/Concepts/Splitter.h b/Spatial_searching/doc/Spatial_searching/Concepts/Splitter.h index a33c19bdc9c..d829df0e1c9 100644 --- a/Spatial_searching/doc/Spatial_searching/Concepts/Splitter.h +++ b/Spatial_searching/doc/Spatial_searching/Concepts/Splitter.h @@ -1,10 +1,8 @@ /*! \ingroup PkgSpatialSearchingDConcepts -\cgalAdvancedConcept +\cgalConcept -\cgalAdvancedBegin The concept `Splitter` defines the requirements for a function object class implementing a splitting rule. -\cgalAdvancedEnd \cgalHasModel `CGAL::Fair` \cgalHasModel `CGAL::Median_of_rectangle`