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

Merge pull request #7700 from albert-github/feature/bug_html_comment 

Incorrect closing HTML comment
This commit is contained in:
Laurent Rineau 2023-09-13 16:17:05 +02:00
parent e04b3a4e6b 3d49105c91
commit 63aa411db2
2 changed files with 5 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Triangulation/doc/Triangulation/PackageDescription.txt
View File

@ -67,7 +67,7 @@ of the underlying Euclidean space \f$ \mathbb{R}^d\f$.
The neighbors of a full cell are also The neighbors of a full cell are also
indexed in such a way that the neighbor indexed by \f$ i\f$ indexed in such a way that the neighbor indexed by \f$ i\f$
is opposite to the vertex with the same index. is opposite to the vertex with the same index.
---> -->
\cgalClassifedRefPages \cgalClassifedRefPages

8
Triangulation/doc/Triangulation/Triangulation.txt
View File

@ -41,7 +41,7 @@ that is pure, connected and without boundaries nor singularities. The
<i>dimension</i> of the triangulation is the dimension of its maximal <i>dimension</i> of the triangulation is the dimension of its maximal
simplices. simplices.
<!--- cardinality, i.e., they have the same number of vertices.---> <!--- cardinality, i.e., they have the same number of vertices. -->
In the sequel, we will call these maximal simplices <I>full cells</I>. In the sequel, we will call these maximal simplices <I>full cells</I>.
A <I>face</I> of a simplex is a subset of this simplex. A <I>face</I> of a simplex is a subset of this simplex.
A <I>proper face</I> of a simplex is a strict subset of this simplex. A <I>proper face</I> of a simplex is a strict subset of this simplex.
@ -136,12 +136,12 @@ Possible values of \f$d\f$ (the <I>current dimension</I> of the triangulation) i
triangulation data structure. triangulation data structure.
<DT><B>\f$d=-1\f$</B><DD> This corresponds to an abstract simplicial <DT><B>\f$d=-1\f$</B><DD> This corresponds to an abstract simplicial
complex reduced to a single vertex. complex reduced to a single vertex.
<!--- and a single full cell. In a geometric triangulation, this vertex corresponds to the vertex at infinity.---> <!--- and a single full cell. In a geometric triangulation, this vertex corresponds to the vertex at infinity. -->
<DT><B>\f$d=0\f$</B><DD> This corresponds to an abstract simplicial <DT><B>\f$d=0\f$</B><DD> This corresponds to an abstract simplicial
complex including two vertices, each corresponding to a full cell; complex including two vertices, each corresponding to a full cell;
the two full cells being neighbors of each other. This is the unique the two full cells being neighbors of each other. This is the unique
triangulation of the \f$ 0\f$-sphere. triangulation of the \f$ 0\f$-sphere.
<!--- (geometrically, the finite vertex and the infinite vertex),---> <!--- (geometrically, the finite vertex and the infinite vertex), -->
<DT><B>\f$ 0< d \le D\f$</B><DD> This corresponds to a triangulation of <DT><B>\f$ 0< d \le D\f$</B><DD> This corresponds to a triangulation of
the sphere \f$ \mathbb{S}^d\f$. the sphere \f$ \mathbb{S}^d\f$.
</DL> </DL>
@ -259,7 +259,7 @@ Therefore, the reader will make
the best use of this example by reading it slowly, together with the reference the best use of this example by reading it slowly, together with the reference
manual documentation of the methods that are called (see here: manual documentation of the methods that are called (see here:
`TriangulationDataStructure`) and by trying to understand the various `TriangulationDataStructure`) and by trying to understand the various
`assert(...)` statements.---> `assert(...)` statements. -->
\cgalExample{triangulation_data_structure_static.cpp} \cgalExample{triangulation_data_structure_static.cpp}