diff --git a/Visibility_2/doc/Visibility_2/visibility_2.txt b/Visibility_2/doc/Visibility_2/visibility_2.txt
index 02e9fe878a0..c74b51a07d4 100644
--- a/Visibility_2/doc/Visibility_2/visibility_2.txt
+++ b/Visibility_2/doc/Visibility_2/visibility_2.txt
@@ -65,7 +65,7 @@ Where  \f$ n \f$ is the number of vertices of \f$ f \f$ and \f$ b \f$ is the num
 
 Every model of the Visibility_2 concept must provide two overloaded member functions, called `Visibility_2::visibility_region()` functions, that compute the visibility region of \f$ p \f$ in a bounded polygonal face \f$ f \f$: one is for the case where \f$ p \f$ is in the interior of \f$ f \f$; the other one is for the case where \f$ p \f$ is on the boundary of \f$ f \f$. 
 
-\section simple_polygon_visibility_example  Example of visibility in a simple polygon.
+\section simple_polygon_visibility_example  Example of Visibility in a Simple Polygon
 The following example shows how to obtain the regularized and non-regularized visibility regions.
 \cgalExample{Visibility_2/simple_polygon_visibility_2.cpp}
 \cgalFigureBegin{simple_example, simple_example.png}