From 7d7d25e5f7eeb6f4222dba33ec43db9a58d4f5a1 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= Date: Wed, 20 Oct 2010 07:55:34 +0000 Subject: [PATCH] typos --- Mesh_2/doc_tex/Mesh_2_ref/MeshingCriteria_2.tex | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/Mesh_2/doc_tex/Mesh_2_ref/MeshingCriteria_2.tex b/Mesh_2/doc_tex/Mesh_2_ref/MeshingCriteria_2.tex index 9b5341d8e0a..337ee8ddb40 100644 --- a/Mesh_2/doc_tex/Mesh_2_ref/MeshingCriteria_2.tex +++ b/Mesh_2/doc_tex/Mesh_2_ref/MeshingCriteria_2.tex @@ -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 $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 -tetrahedra can be added to the set of criteria without compromising +triangle can be added to the set of criteria without compromising the termination. 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 size criteria everywhere, the \ccc{Is_bad} predicate has to return \ccc{IMPERATIVELY_BAD} when size criteria are not satisfied, and