diff --git a/Polygon_repair/doc/Polygon_repair/PackageDescription.txt b/Polygon_repair/doc/Polygon_repair/PackageDescription.txt
index 98d974c7a438..31e905f74c2a 100644
--- a/Polygon_repair/doc/Polygon_repair/PackageDescription.txt
+++ b/Polygon_repair/doc/Polygon_repair/PackageDescription.txt
@@ -36,6 +36,7 @@ The %union and the %intersection rule enable to combine similar polygons. }
 
 \cgalCRPSection{Repair Rules}
 - `CGAL::Polygon_repair::Even_odd_rule`
+- `CGAL::Polygon_repair::Non_zero_rule`
 - `CGAL::Polygon_repair::Union_rule`
 - `CGAL::Polygon_repair::Intersection_rule`
 */
diff --git a/Polygon_repair/doc/Polygon_repair/Polygon_repair.txt b/Polygon_repair/doc/Polygon_repair/Polygon_repair.txt
index ecb8a9f694aa..76206fa829e6 100644
--- a/Polygon_repair/doc/Polygon_repair/Polygon_repair.txt
+++ b/Polygon_repair/doc/Polygon_repair/Polygon_repair.txt
@@ -194,6 +194,8 @@ to edges, which enables correct counting even on partially overlapping edges.
 
 Ken Arroyo Ohori developed this package during the Google Summer of
 Code 2023 mentored by Sébastien Loriot and Andreas Fabri.
+The GSoC project was limited to the even-odd rule. Further rules were added
+with CGAL 6.1 by Andreas Fabri.
 
 */
 } /* namespace CGAL */
diff --git a/Polygon_repair/include/CGAL/Polygon_repair/Intersection_rule.h b/Polygon_repair/include/CGAL/Polygon_repair/Intersection_rule.h
index 46e1aeaf51eb..1bf449fb6927 100644
--- a/Polygon_repair/include/CGAL/Polygon_repair/Intersection_rule.h
+++ b/Polygon_repair/include/CGAL/Polygon_repair/Intersection_rule.h
@@ -22,7 +22,7 @@ namespace Polygon_repair {
 /// @{
 
 /*!
-  Tag class to select the %ntersection rule when calling `CGAL::Polygon_repair::repair()`.
+  Tag class to select the %intersection rule when calling `CGAL::Polygon_repair::repair()`.
   */
   struct Intersection_rule {};