classified ref man for Triangulation_3

Triangulation_3/doc/Triangulation_3/PackageDescription.txt

@@ -33,5 +33,76 @@
 \cgalPkgDescriptionEnd
 
 
+A three-dimensional triangulation is a three-dimensional simplicial
+complex, pure connected and without singularities \cite by-ag-98. Its
+cells (`3`-faces) are such that two cells either do not intersect or
+share a common facet (`2`-face), edge (`1`-face) or vertex (`0`-face).
+
+The basic 3D-triangulation class of \cgal\ is primarily designed to
+represent the triangulations of a set of points \f$ A \f$ in \f$ \mathbb{R}^3 \f$.  It can
+be viewed as a partition of the convex hull of \f$ A \f$ into tetrahedra
+whose vertices are the points of \f$ A \f$.  Together with the unbounded
+cell having the convex hull boundary as its frontier, the triangulation
+forms a partition of \f$ \mathbb{R}^3 \f$.
+
+In order to deal only with tetrahedra, which is convenient for many applications, the
+unbounded cell can be subdivided into tetrahedra by considering that
+each convex hull facet is incident to an <i>infinite cell</i> having as
+fourth vertex an auxiliary vertex called the <i>infinite vertex</i>.  In
+that way, each facet is incident to exactly two cells and special cases
+at the boundary of the convex hull are simple to deal with.
+
+
+A triangulation is a collection of vertices and cells that are linked
+together through incidence and adjacency relations. Each cell gives
+access to its four incident vertices and to its four adjacent
+cells. Each vertex gives access to one of its incident cells.
+
+The four vertices of a cell are indexed with 0, 1, 2 and 3 in positive
+orientation, the positive orientation being defined by the orientation
+of the underlying Euclidean space \f$ \mathbb{R}^3 \f$. The neighbors of a cell are also
+indexed with 0, 1, 2, 3 in such a way that the neighbor indexed by `i`
+is opposite to the vertex with the same index. See
+Figure \cgalFigureRef{Triangulation3figorient}.
+
+\section T3_Concepts Concepts
+
+- `TriangulationTraits_3`
+- `DelaunayTriangulationTraits_3`
+- `RegularTriangulationTraits_3`
+- `TriangulationCellBase_3`
+- `TriangulationVertexBase_3`
+- `TriangulationVertexBaseWithInfo_3`
+- `TriangulationHierarchyVertexBase_3`
+- `RegularTriangulationCellBase_3`
+- `TriangulationDataStructure_3`
+- `WeightedPoint`
+
+\section T3_Classes Classes
+
+\subsection T3_MainClasses Main Classes
+
+- `CGAL::Triangulation_3<TriangulationTraits_3,TriangulationDataStructure_3>`
+- `CGAL::Delaunay_triangulation_3<DelaunayTriangulationTraits_3,TriangulationDataStructure_3,LocationPolicy>`
+- `CGAL::Triangulation_hierarchy_3<Tr>`
+- `CGAL::Regular_triangulation_3<RegularTriangulationTraits_3,TriangulationDataStructure_3>`
+- `CGAL::Triangulation_cell_base_3<TriangulationTraits_3, TriangulationDSCellBase_3>`
+- `CGAL::Triangulation_cell_base_with_info_3<Info, TriangulationTraits_3, TriangulationCellBase_3>`
+- `CGAL::Triangulation_cell_base_with_circumcenter_3<DelaunayTriangulationTraits_3, TriangulationCellBase_3>`
+- `CGAL::Triangulation_vertex_base_3<TriangulationTraits_3, TriangulationDSVertexBase_3>`
+- `CGAL::Triangulation_vertex_base_with_info_3<Info, TriangulationTraits_3, TriangulationVertexBase_3>`
+- `CGAL::Triangulation_hierarchy_vertex_base_3<TriangulationVertexBase_3>`
+- `CGAL::Regular_triangulation_cell_base_3<Traits,Cb>`
+- `CGAL::Triangulation_simplex_3<Triangulation_3>`
+
+\subsection T3_TraitsClasses Traits Classes
+
+- `CGAL::Regular_triangulation_euclidean_traits_3<K,Weight>`
+
+\section T3_Enums Enums
+
+- `CGAL::Triangulation_3::Locate_type`
+
+
 */