diff --git a/Triangulation/doc/Triangulation/Concepts/DelaunayTriangulationTraits.h b/Triangulation/doc/Triangulation/Concepts/DelaunayTriangulationTraits.h index c5e0733037c..c7773eba7bf 100644 --- a/Triangulation/doc/Triangulation/Concepts/DelaunayTriangulationTraits.h +++ b/Triangulation/doc/Triangulation/Concepts/DelaunayTriangulationTraits.h @@ -5,15 +5,13 @@ This concept describes the geometric types and predicates required to build a Delaunay triangulation. It corresponds to the first template parameter of the class -`Delaunay_triangulation`. +`CGAL::Delaunay_triangulation`. \cgalRefines ::TriangulationTraits. -\cgalHasModel `CGAL::Cartesian_d` -\cgalHasModel `CGAL::Epick_d` (recommended) +\cgalHasModel `CGAL::Epick_d` \sa `TriangulationTraits` -\sa `DelaunayTriangulation` */ class DelaunayTriangulationTraits { public: diff --git a/Triangulation/doc/Triangulation/Concepts/TriangulationTraits.h b/Triangulation/doc/Triangulation/Concepts/TriangulationTraits.h index bb00aedfef0..d66dd83d7f1 100644 --- a/Triangulation/doc/Triangulation/Concepts/TriangulationTraits.h +++ b/Triangulation/doc/Triangulation/Concepts/TriangulationTraits.h @@ -5,7 +5,7 @@ This concept describes the geometric types and predicates required to build a triangulation. It corresponds to the first template parameter of the class -`Triangulation`. +`CGAL::Triangulation`. \cgalRefines `SpatialSortingTraits_d` @@ -14,8 +14,7 @@ traits must refine `SpatialSortingTraits_d`. The insertion is then optimized using spatial sorting. This is not required if the points are inserted one by one. -\cgalHasModel `CGAL::Cartesian_d` -\cgalHasModel `CGAL::Epick_d` (recommended) +\cgalHasModel `CGAL::Epick_d` \sa `DelaunayTriangulationTraits` */