diff --git a/_posts/2024-07-05-mesh3-improvements.md b/_posts/2024-07-05-mesh3-improvements.md
index a1ee0f0d..9d248a8b 100644
--- a/_posts/2024-07-05-mesh3-improvements.md
+++ b/_posts/2024-07-05-mesh3-improvements.md
@@ -29,9 +29,9 @@ mesh generation algorithm to represent the input surface in a more accurate way,
Recent releases of CGAL have introduced improvements to the 3D Tetrahedral Mesh Generation package: detection and protection of triple lines from labeled images, -use of weighted labeled images, -dealing with self-intersecting input surfaces, -and a new approximation error criterion for polyline features.
+generation and use of weighted labeled images, +a new approximation error criterion for polyline features, +and the ability to deal with self-intersecting input surfaces.A Delaunay refinement algorithm is guided by meshing criteria that trigger Steiner vertices insertions, +until they are satisfied. +The list of CGAL meshing criteria has been enriched with a new criterion that enables the user to +define an upper bound on the distance between the input feature graph and the output feature edges.
+ +The following example shows how to use this new criterion, called edge_distance: + +mesh_polyhedral_domain_with_edge_distance.cpp.
+#TODO : add image here to illustrate edge_distance