diff --git a/Convex_hull_3/include/CGAL/Convex_hull_3/dual/interior_polyhedron_3.h b/Convex_hull_3/include/CGAL/Convex_hull_3/dual/interior_polyhedron_3.h
index d8878a3c654..234899d2a2e 100644
--- a/Convex_hull_3/include/CGAL/Convex_hull_3/dual/interior_polyhedron_3.h
+++ b/Convex_hull_3/include/CGAL/Convex_hull_3/dual/interior_polyhedron_3.h
@@ -29,7 +29,7 @@
 #include <limits>
 #include <CGAL/number_utils.h>
 
-// Taken from http://www.qhull.org/html/qhalf.htm
+// Description taken from http://www.qhull.org/html/qhalf.htm
 
 // If you do not know an interior point for the halfspaces, use linear programming
 // to find one. Assume, n halfspaces defined by: aj*x1+bj*x2+cj*x3+dj>=0, j=1..n.