mirror of https://github.com/CGAL/cgal
more doc fixes
This commit is contained in:
parent
136d296943
commit
c93a08987a
|
|
@ -11,12 +11,12 @@ of dimension $k\leq d$.
|
|||
\ccc{Dimensionality} can be either \begin{itemize}
|
||||
|
||||
\item \ccPureGlobalScope\ccc{Dimension_tag<d>} for some integer \ccc{d}. This
|
||||
indicates that the pure complex can store simplices of dimension at most
|
||||
indicates that the triangulation data structure can store simplices (full cells) of dimension at most
|
||||
\ccc{d}. The maximum dimension \ccc{d} is known by the compiler, which
|
||||
triggers some optimizations. Or
|
||||
|
||||
\item \ccPureGlobalScope\ccc{Dynamic_dimension_tag}. In this case, the maximum
|
||||
dimension of the simplices is passed as an integer argument to an instance
|
||||
dimension of the simplices (full cells) is passed as an integer argument to an instance
|
||||
constructor (see \ccc{TriangulationDataStructure}).\end{itemize}
|
||||
|
||||
\ccc{TDSVertex} is the class to be used as the base \ccc{Vertex} type in the
|
||||
|
|
@ -38,6 +38,8 @@ third parameter. In both cases, \ccc{TDSFullCell} defaults to
|
|||
|
||||
\ccc{TriangulationDataStructure}.
|
||||
|
||||
In addition, the class \ccRefName\ provides the following types and methods:
|
||||
|
||||
\ccCreation
|
||||
\ccCreationVariable{t}
|
||||
|
||||
|
|
|
|||
|
|
@ -8,7 +8,7 @@ TDSFullCell>}.
|
|||
|
||||
This class does not provide any geometric capabilities but only combinatorial
|
||||
(adjacency) information. Thus, if the \ccc{Triangulation_data_structure} is
|
||||
used as a parameter of a geometric complex, then its full cell template
|
||||
used as a parameter of a (embedded) \ccc{Triangulation}, then its full cell template
|
||||
parameter has to fulfill additional geometric requirements, i.e. it has to be
|
||||
a model of the refined concept \ccc{TriangulationFullCell}.
|
||||
|
||||
|
|
|
|||
|
|
@ -8,7 +8,7 @@ TDSFullCell>}.
|
|||
|
||||
This class does not contain any geometric information but only combinatorial
|
||||
(adjacency) information. Thus, if the \ccc{Triangulation_data_structure} is
|
||||
used as a parameter of a geometric complex, then its vertex template parameter
|
||||
used as a parameter of a (embedded) \ccc{Triangulation}, then its vertex template parameter
|
||||
has to fulfill additional geometric requirements, \emph{i.e.}, it has to be a
|
||||
model of the refined concept \ccc{TriangulationVertex}.
|
||||
|
||||
|
|
|
|||
Loading…
Reference in New Issue