diff --git a/Triangulation_2/doc/Triangulation_2/CGAL/mark_domain_in_triangulation.h b/Triangulation_2/doc/Triangulation_2/CGAL/mark_domain_in_triangulation.h
index 9c98da9b802..b82bf923434 100644
--- a/Triangulation_2/doc/Triangulation_2/CGAL/mark_domain_in_triangulation.h
+++ b/Triangulation_2/doc/Triangulation_2/CGAL/mark_domain_in_triangulation.h
@@ -2,7 +2,8 @@ namespace CGAL {
 
 /*!
 \ingroup PkgTriangulation2Miscellaneous
-marks faces connected with non constrained edges
+
+\brief marks faces connected with non constrained edges
 as inside of the domain based on the nesting level.
 
 The function starts from facets incident to the infinite vertex, with a nesting
@@ -10,6 +11,8 @@ level of 0. Then recursively considers the non-explored facets incident
 to constrained edges bounding the former set and increase the nesting level by 1.
 Facets in the domain are those with an odd nesting level.
 
+For this overload, the "in domain" information is set in `ipm`.
+
 \tparam CT a constrained triangulation
 \tparam InDomainPmap a class model of `ReadWritePropertyMap` with `CT::Face_handle` as key type and `bool` as value type.
 
@@ -23,9 +26,17 @@ mark_domain_in_triangulation(CT& ct, InDomainPmap ipm);
 
  /*!
 \ingroup PkgTriangulation2Miscellaneous
-As the function above.
 
-Requires that the face type of `CT` has the methods `bool is_in_domain()`  and `void set_in_domain(bool)`.
+\brief marks faces connected with non constrained edges
+as inside of the domain based on the nesting level.
+
+The function starts from facets incident to the infinite vertex, with a nesting
+level of 0. Then recursively considers the non-explored facets incident
+to constrained edges bounding the former set and increase the nesting level by 1.
+Facets in the domain are those with an odd nesting level.
+
+For this overload, the "in domain" marker is contained in the face type of `CT`, which must provide
+the methods `bool is_in_domain()`  and `void set_in_domain(bool)`.
 
 \tparam CT a constrained triangulation