diff --git a/Convex_hull_3/doc/Convex_hull_3/CGAL/convex_hull_3.h b/Convex_hull_3/doc/Convex_hull_3/CGAL/convex_hull_3.h
index 59fa52ef06b..41e6e53cf4d 100644
--- a/Convex_hull_3/doc/Convex_hull_3/CGAL/convex_hull_3.h
+++ b/Convex_hull_3/doc/Convex_hull_3/CGAL/convex_hull_3.h
@@ -7,8 +7,6 @@ namespace CGAL {
 [`first`, `last`). The polyhedron `pm` is cleared, then
 the convex hull is stored in `pm`. Note that the convex hull will be triangulated,
 that is `pm` will contain only triangular facets.
- 
-\attention This function does not compute the plane equations of the faces of `pm`.
 
 \pre There are at least four points in the range 
 [`first`, `last`) not all of which are collinear.
@@ -20,8 +18,6 @@ For the purposes of checking the postcondition that the convex hull
 is valid, `Traits` must also be a model of the concept 
 `IsStronglyConvexTraits_3`. 
 
-
-
 If the kernel `R` of the points determined by the value type of `InputIterator` 
 is a kernel with exact predicates but inexact constructions 
 (in practice we check `R::Has_filtered_predicates_tag` is `Tag_true` and `R::FT` is a floating point type), 
@@ -47,9 +43,6 @@ a triangle, or a polyhedron, is stored in `ch_object`.
 In the case the result is a polyhedron, the convex hull will be triangulated,
 that is the polyhedron will contain only triangular facets.
 
-\attention This function does not compute the plane equations of the faces of `pm`
-in case the result is a polyhedron.
-
 \tparam InputIterator must be an input iterator with a value type  equivalent to `Traits::Point_3`. 
 \tparam Traits must be model of the concept `ConvexHullTraits_3`. 
 For the purposes of checking the postcondition that the convex hull 
diff --git a/Convex_hull_3/doc/Convex_hull_3/CGAL/convex_hull_3_to_face_graph.h b/Convex_hull_3/doc/Convex_hull_3/CGAL/convex_hull_3_to_face_graph.h
index b98439e2701..a2d654dcb5d 100644
--- a/Convex_hull_3/doc/Convex_hull_3/CGAL/convex_hull_3_to_face_graph.h
+++ b/Convex_hull_3/doc/Convex_hull_3/CGAL/convex_hull_3_to_face_graph.h
@@ -7,8 +7,6 @@ fills a polyhedron with the convex hull of a set of 3D points contained in a 3D
 
 The polyhedron `pm` is cleared and the convex hull of the set of 3D points is stored in `pm`.
 
-\attention This function does not compute the plane equations of the faces of `pm`.
-
 \pre `T.dimension()`==3.
 
 \tparam Triangulation must be a \cgal 3D triangulation