diff --git a/TDS_2/doc/TDS_2/Concepts/TriangulationDSFaceBase_2.h b/TDS_2/doc/TDS_2/Concepts/TriangulationDSFaceBase_2.h index db4d467238e..4d17e03cf52 100644 --- a/TDS_2/doc/TDS_2/Concepts/TriangulationDSFaceBase_2.h +++ b/TDS_2/doc/TDS_2/Concepts/TriangulationDSFaceBase_2.h @@ -4,7 +4,7 @@ \cgalConcept The concept `TriangulationDSFaceBase_2` describes the requirements for -the base face of a `CGAL::Triangulation_data_structure_2`. +the face base class of a `CGAL::Triangulation_data_structure_2`. Note that if the `CGAL::Triangulation_data_structure_2` is plugged into a triangulation class, @@ -30,7 +30,7 @@ In order to break the cycle, the base classes for faces and vertices which are plugged in to instantiate a `CGAL::Triangulation_data_structure_2` -use a `void` as triangulation +use `void` as triangulation data structure parameter. Then, the `CGAL::Triangulation_data_structure_2` uses a rebind mechanism (similar to the one specified in @@ -46,6 +46,8 @@ that the `CGAL::Triangulation_data_structure_2` actually uses as a base class for the class `CGAL::Triangulation_data_structure_2::Face`. +\cgalRefines `TriangulationDataStructure_2::Face` + \cgalHasModel `CGAL::Triangulation_ds_face_base_2` \cgalHasModel `CGAL::Triangulation_face_base_2` \cgalHasModel `CGAL::Regular_triangulation_face_base_2` diff --git a/TDS_2/doc/TDS_2/Concepts/TriangulationDSVertexBase_2.h b/TDS_2/doc/TDS_2/Concepts/TriangulationDSVertexBase_2.h index f84d6af8845..35245d1a609 100644 --- a/TDS_2/doc/TDS_2/Concepts/TriangulationDSVertexBase_2.h +++ b/TDS_2/doc/TDS_2/Concepts/TriangulationDSVertexBase_2.h @@ -4,16 +4,16 @@ \cgalConcept The concept `TriangulationDSVertexBase_2` describes the requirements for the -vertex base class of a `CGAL::Triangulation_data_structure_2`. +vertex base class of a `CGAL::Triangulation_data_structure_2`. Note that if the `CGAL::Triangulation_data_structure_2` is plugged into a triangulation class, -the vertex base class has additional geometric +the vertex base class may have additional geometric requirements depending on the triangulation class. At the base level, provides access to one of its incident -face through a `Face_handle`. +faces through a `Face_handle`. Since the `CGAL::Triangulation_data_structure_2` is the class which defines the handle @@ -26,7 +26,7 @@ In order to break the cycle, the base classes for faces and vertices which are plugged in to instantiate a `Triangulation_data_structure_2` -use a `void` as triangulation +use `void` as triangulation data structure parameter. Then, the `CGAL::Triangulation_data_structure_2` uses a rebind mechanism (similar to the one specified in