mirror of https://github.com/CGAL/cgal
Misc minor fixes
This commit is contained in:
parent
6e69d886e3
commit
19ceed98b8
|
|
@ -14,7 +14,7 @@ The class `Triangulation_ds_face_base_2` is a model for the concept
|
|||
\sa `CGAL::Triangulation_ds_vertex_base_2<Tds>`
|
||||
|
||||
*/
|
||||
template< typename Tds >
|
||||
template< typename TDS >
|
||||
class Triangulation_ds_face_base_2 {
|
||||
public:
|
||||
|
||||
|
|
|
|||
|
|
@ -18,13 +18,15 @@ geometric triangulation, there are additional geometric requirements
|
|||
to be fulfilled by the vertex base class,
|
||||
and `Triangulation_ds_vertex_base_2` cannot be plugged in.
|
||||
|
||||
\tparam TDS A
|
||||
|
||||
\cgalModels `TriangulationDSVertexBase_2`
|
||||
|
||||
\sa `CGAL::Triangulation_vertex_base_2<Traits,Vb>`
|
||||
\sa `CGAL::Triangulation_ds_face_base_2<Tds>`
|
||||
\sa `CGAL::Triangulation_ds_face_base_2<TDS>`
|
||||
|
||||
*/
|
||||
template< typename Tds >
|
||||
template< typename TDS >
|
||||
class Triangulation_ds_vertex_base_2 {
|
||||
public:
|
||||
|
||||
|
|
|
|||
|
|
@ -723,8 +723,9 @@ triangulation data structure.
|
|||
|
||||
\cgalHasModel `CGAL::Triangulation_ds_vertex_base_2<Tds>`
|
||||
|
||||
\sa `TriangulationDataStructure_2`
|
||||
\sa `TriangulationDSVertexBase_2`
|
||||
\sa `TriangulationDataStructure_2::Face`
|
||||
\sa `TriangulationDataStructure_2`
|
||||
|
||||
*/
|
||||
class TriangulationDataStructure_2::Vertex {
|
||||
|
|
@ -843,9 +844,9 @@ define new faces and to delete no longer used faces.
|
|||
|
||||
\cgalHasModel `CGAL::Triangulation_ds_face_base_2<Tds>`
|
||||
|
||||
\sa `TriangulationDSFaceBase_2`
|
||||
\sa `TriangulationDataStructure_2`
|
||||
\sa `TriangulationDataStructure_2::Vertex`
|
||||
\sa `TriangulationFaceBase_2`
|
||||
|
||||
*/
|
||||
class TriangulationDataStructure_2::Face {
|
||||
|
|
|
|||
|
|
@ -58,7 +58,7 @@ These refining concepts and their models are described in Chapter
|
|||
- `TriangulationDSVertexBase_2`
|
||||
|
||||
\cgalCRPSection{Classes}
|
||||
- `CGAL::Triangulation_data_structure_2<VertexBase,FaceBase>`
|
||||
- `CGAL::Triangulation_data_structure_2<Vb,Fb>`
|
||||
- `CGAL::Triangulation_ds_face_base_2<Tds>`
|
||||
- `CGAL::Triangulation_ds_vertex_base_2<Tds>`
|
||||
|
||||
|
|
|
|||
|
|
@ -19,7 +19,6 @@ additional template parameters.
|
|||
|
||||
\tparam CellBase must be a model of `TriangulationDSCellBase_3`. The default is `Triangulation_ds_cell_base_3<TDS>`.
|
||||
|
||||
|
||||
\tparam ConcurrencyTag enables the use of a concurrent
|
||||
container to store vertices and cells. It can be `Sequential_tag` (use of a
|
||||
`Compact_container` to store vertices and cells) or `Parallel_tag`
|
||||
|
|
|
|||
|
|
@ -12,10 +12,9 @@ The class `Triangulation_ds_cell_base_3<>` is a model for the concept
|
|||
|
||||
\sa `CGAL::Triangulation_cell_base_3`
|
||||
\sa `CGAL::Triangulation_ds_vertex_base_3`
|
||||
\sa `CGAL::Triangulation_cell_base_with_info_3`
|
||||
|
||||
*/
|
||||
template< typename TDS = void >
|
||||
template< typename TDS >
|
||||
class Triangulation_ds_cell_base_3 {
|
||||
public:
|
||||
|
||||
|
|
|
|||
|
|
@ -22,7 +22,6 @@ example) tuned for a specific application.
|
|||
|
||||
\sa `CGAL::Triangulation_vertex_base_3`
|
||||
\sa `CGAL::Triangulation_ds_cell_base_3`
|
||||
\sa `CGAL::Triangulation_vertex_base_with_info_3`
|
||||
|
||||
*/
|
||||
template< typename TDS = void >
|
||||
|
|
|
|||
|
|
@ -40,8 +40,6 @@ the dimension of the triangulation is lower than 3
|
|||
Thus, a 3D-triangulation data structure can store a triangulation of a
|
||||
topological sphere \f$ S^d\f$ of \f$ \mathbb{R}^{d+1}\f$, for any \f$ d \in \{-1,0,1,2,3\}\f$.<BR>
|
||||
|
||||
|
||||
|
||||
The second template parameter of the basic triangulation class
|
||||
(see Chapter \ref chapterTriangulation3 "3D Triangulations")
|
||||
`CGAL::Triangulation_3` is a triangulation data structure class. (See
|
||||
|
|
@ -67,7 +65,7 @@ neighbors of each cell, where the index corresponds to the preceding
|
|||
list of cells. When dimension < 3, the same information is stored
|
||||
for faces of maximal dimension instead of cells.
|
||||
|
||||
\cgalHasModel `CGAL::Triangulation_data_structure_3`
|
||||
\cgalHasModel `CGAL::Triangulation_data_structure_3<Vb, Cb>`
|
||||
|
||||
\sa `TriangulationDataStructure_3::Vertex`
|
||||
\sa `TriangulationDataStructure_3::Cell`
|
||||
|
|
|
|||
|
|
@ -57,7 +57,7 @@ Section \ref TDS3secintro.)
|
|||
|
||||
\cgalCRPSection{Classes}
|
||||
|
||||
- `CGAL::Triangulation_data_structure_3<VertexBase,CellBase,ConcurrencyTag>` is a model for the concept of the 3D-triangulation data structure `TriangulationDataStructure_3`. It is templated by base classes for vertices and cells.
|
||||
- `CGAL::Triangulation_data_structure_3<Vb,Cb,CT>` is a model for the concept of the 3D-triangulation data structure `TriangulationDataStructure_3`. It is templated by base classes for vertices and cells.
|
||||
|
||||
\cgal provides base vertex classes and base cell classes:
|
||||
|
||||
|
|
|
|||
Loading…
Reference in New Issue