diff --git a/Polygon_repair/doc/Polygon_repair/Polygon_repair.txt b/Polygon_repair/doc/Polygon_repair/Polygon_repair.txt
index 54edf8f9898..746f5874c75 100644
--- a/Polygon_repair/doc/Polygon_repair/Polygon_repair.txt
+++ b/Polygon_repair/doc/Polygon_repair/Polygon_repair.txt
@@ -17,11 +17,12 @@ or hole), and reconstructs the polygon(s) represented by the arrangement.
 The method returns valid output stored in a multipolygon with holes.
 
 Different arrangement and labelling heuristics are possible, but
-currently only the even-odd heuristic is implemented in the package.
-This heuristic results in areas that are alternately assigned as polygon
+currently only the <em>even-odd</em> rule is implemented in this package.
+This rule results in areas that are alternately assigned as polygon
 interiors and exterior/holes each time that an input edge is passed.
 It does not distinguish between edges that are part of outer boundaries
-from those of inner boundaries.
+from those of inner boundaries.  In a next version we will add the
+<em>winding number</em> rule.
 
 \section SectionPolygonRepair_Definitions Definitions
 
@@ -104,7 +105,7 @@ or multipolygon is merely used as a container of input line segments. These line
 segments are added to the arrangement as edges. Internally, this is done using
 a constrained triangulation where they are added as constraints.
 
-With the even-odd heuristic, only the edges that are present an odd number of
+With the even-odd rule, only the edges that are present an odd number of
 times in the input will be edges in the final arrangement.
 When these edges are only partially overlapping, only the parts that overlap
 an odd number of times will be edges in the final arrangement.
@@ -120,7 +121,7 @@ First, the polygon exterior is labeled. For this, all of the faces that can be
 accessed from the exterior without passing through an edge are labeled as exterior
 faces.
 
-Then, all other faces are labeled. For the even-odd heuristic, the label applied
+Then, all other faces are labeled. For the even-odd rule, the label applied
 alternates between polygon interior and hole every time that an edge is passed.
 
 \subsection SubsectionPolygonRepair_Reconstruction Reconstruction of the Multipolygon
@@ -175,14 +176,14 @@ since all of these intersections need to be calculated in the overlay.
 
 The polygon repair method as originally developed is described by Ledoux et al.
 \cgalCite{ledoux2014triangulation} and implemented in the
-<a href="https://github.com/tudelft3d/prepair/">prepair</a> software.
+<a href="https://github.com/tudelft3d/prepair/"><em>prepair</em></a> software.
 This package is a reimplementation of the method with a new approach to label
 and reconstruct the multipolygons. It also incorporates improvements later
-added to prepair, such as the application of the even-odd counting heuristic
+added to <em>prepair</em>, such as the application of the even-odd counting heuristics
 to edges, which enables correct counting even on partially overlapping edges.
 
 Ken Arroyo Ohori developed this package during the Google Summer of
-Code 2023 under the mentorship of Sébastien Loriot and Andreas Fabri.
+Code 2023 mentored by Sébastien Loriot and Andreas Fabri.
 
 */
 } /* namespace CGAL */
diff --git a/Polygon_repair/include/CGAL/Polygon_repair/Even_odd_rule.h b/Polygon_repair/include/CGAL/Polygon_repair/Even_odd_rule.h
index 769ad264038..619d3b7fd8b 100644
--- a/Polygon_repair/include/CGAL/Polygon_repair/Even_odd_rule.h
+++ b/Polygon_repair/include/CGAL/Polygon_repair/Even_odd_rule.h
@@ -21,6 +21,7 @@ namespace Polygon_repair {
   /*!
   \addtogroup PkgPolygonRepairRef
 
+  Tag class to select the even odd rule when calling `CGAL::Polygon_repair::repair()`.
   */
   struct Even_odd_rule {};
 
diff --git a/Polygon_repair/include/CGAL/Polygon_repair/Polygon_repair.h b/Polygon_repair/include/CGAL/Polygon_repair/Polygon_repair.h
index b3453d6146a..4e12f0b11f0 100644
--- a/Polygon_repair/include/CGAL/Polygon_repair/Polygon_repair.h
+++ b/Polygon_repair/include/CGAL/Polygon_repair/Polygon_repair.h
@@ -33,7 +33,10 @@ class Polygon_repair;
 #endif
 
 /// \ingroup PkgPolygonRepairFunctions
-/// Repair a polygon without holes using
+/// repairs a polygon without holes using the given rule
+/// \tparam Kernel parameter of the input and output polygons
+/// \tparam Container parameter of the input and output polygons
+///  \tparam Rule must be `Even_odd_rule`
 template <class Kernel, class Container, class Rule>
 Multipolygon_with_holes_2<Kernel, Container> repair(const Polygon_2<Kernel, Container>& , Rule rule) {
     CGAL_assertion(false); // rule not implemented
@@ -51,7 +54,10 @@ Multipolygon_with_holes_2<Kernel, Container> repair(const Polygon_2<Kernel, Cont
 }
 
 /// \ingroup PkgPolygonRepairFunctions
-/// Repair a polygon with holes
+/// repairs a polygon with holes using the given rule
+/// \tparam Kernel parameter of the input and output polygons
+/// \tparam Container parameter of the input and output polygons
+///  \tparam Rule must be `Even_odd_rule`
 template <class Kernel, class Container, class Rule>
 Multipolygon_with_holes_2<Kernel, Container> repair(const Polygon_with_holes_2<Kernel, Container>& p, Rule rule) {
   CGAL_assertion(false); // rule not implemented
@@ -69,7 +75,10 @@ Multipolygon_with_holes_2<Kernel, Container> repair(const Polygon_with_holes_2<K
 }
 
 /// \ingroup PkgPolygonRepairFunctions
-/// Repair a multipolygon with holes
+/// repairs a multipolygon with holes using the given rule
+/// \tparam Kernel parameter of the input and output polygons
+/// \tparam Container parameter of the input and output polygons
+///  \tparam Rule must be `Even_odd_rule`
 template <class Kernel, class Container, class Rule>
 Multipolygon_with_holes_2<Kernel, Container> repair(const Multipolygon_with_holes_2<Kernel, Container>& mp, Rule rule) {
   CGAL_assertion(false); // rule not implemented