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

typos

This commit is contained in:
Sébastien Loriot 2010-10-20 07:55:34 +00:00
parent 27d58d7229
commit 7d7d25e5f7
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
Mesh_2/doc_tex/Mesh_2_ref/MeshingCriteria_2.tex
View File

@ -17,11 +17,11 @@ The termination of the algorithm is guaranteed when criteria are shape
criteria corresponding to a bound on smallest angles not less than criteria corresponding to a bound on smallest angles not less than
$20.7$ degrees (this corresponds to a radius-edge ratio bound not less $20.7$ degrees (this corresponds to a radius-edge ratio bound not less
than $\sqrt{2}$). Any size criteria that are satisfied by small enough than $\sqrt{2}$). Any size criteria that are satisfied by small enough
tetrahedra can be added to the set of criteria without compromising triangle can be added to the set of criteria without compromising
the termination. the termination.
Note that, in the presence of input angles smaller than $60$~degrees, Note that, in the presence of input angles smaller than $60$~degrees,
some bad shaped triangles can appear in the finale mesh in the some bad shaped triangles can appear in the final mesh in the
neighboring of small angles. To achieve termination and the respect of neighboring of small angles. To achieve termination and the respect of
size criteria everywhere, the \ccc{Is_bad} predicate has to return size criteria everywhere, the \ccc{Is_bad} predicate has to return
\ccc{IMPERATIVELY_BAD} when size criteria are not satisfied, and \ccc{IMPERATIVELY_BAD} when size criteria are not satisfied, and