songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

fix tiny errors

This commit is contained in:
Samuel Hornus 2011-05-10 21:32:05 +00:00
parent af70f1d297
commit f17dfaca4e
1 changed files with 6 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
Triangulation/doc_tex/Triangulation_ref/TriangulationDataStructure.tex
View File

@ -22,7 +22,7 @@ $\sphere^D.$
\item[-1] This corresponds to a single vertex and a single simplex. In a \item[-1] This corresponds to a single vertex and a single simplex. In a
geometric realization of the \ccRefName\ (\emph{e.g.}, in a geometric realization of the \ccRefName\ (\emph{e.g.}, in a
\ccc{Triangulation<TrTraits, TDS>} or a \ccc{Triangulation<TrTraits, TDS>} or a
\ccc{Delaunay_triangulation<TrTraits, TDS>}), this vertex \ccc{Delaunay_triangulation<DTTraits, TDS>}), this vertex
corresponds to \emph{the vertex at infinity}. corresponds to \emph{the vertex at infinity}.
\item[0] This corresponds to two vertices, each adjacent to one $0$-simplex; \item[0] This corresponds to two vertices, each adjacent to one $0$-simplex;
@ -41,7 +41,7 @@ is a proper face of $\sigma$.
\ccHasModels \ccHasModels
\ccc{Triangulation_data_structure<Dimensionality, TDSVertex, TDSSimplex>} \ccc{Triangulation_data_structure<Dimensionality, TDSVertex, TDSFullCell>}
\ccTypes \ccTypes
@ -50,9 +50,9 @@ is a proper face of $\sigma$.
A model of the concept \ccc{TriangulationDSVertex}. A model of the concept \ccc{TriangulationDSVertex}.
} }
\ccGlue \ccGlue
\ccNestedType{Simplex} \ccNestedType{Full_cell}
{ {
A model of the concept \ccc{TriangulationDSSimplex}. A model of the concept \ccc{TriangulationDSFullCell}.
} }
The concept \ccRefName\ also defines a type for describing facets of the The concept \ccRefName\ also defines a type for describing facets of the
@ -103,7 +103,7 @@ Iterator over the list of vertices.
%Iterator over the list of vertices (\ccc{const} casted). %Iterator over the list of vertices (\ccc{const} casted).
%} %}
\ccGlue \ccGlue
\ccNestedType{Full _cell_iterator} \ccNestedType{Full_cell_iterator}
{ {
Iterator over the list of cells. Iterator over the list of cells.
} }
@ -169,7 +169,7 @@ cells are also good.\\
The argument \ccc{tp} is a predicate that takes as argument a \ccc{Facet} The argument \ccc{tp} is a predicate that takes as argument a \ccc{Facet}
whose containing \ccc{Full_cell} is good. The predicate must return \ccc{true} whose containing \ccc{Full_cell} is good. The predicate must return \ccc{true}
if the traversal of that \ccc{Facet} leads to a good cell.\\ if the traversal of that \ccc{Facet} leads to a good cell.\\
All the good cells are outputed into the last argument \ccc{out}.} All the good cells are outputted into the last argument \ccc{out}.}
\ccMethod{template< typename OutputIterator > OutputIterator \ccMethod{template< typename OutputIterator > OutputIterator
incident_full_cells(Vertex_handle v, OutputIterator out) const;} incident_full_cells(Vertex_handle v, OutputIterator out) const;}