Merge branch 'PMP-kernel' of github.com:sloriot/cgal into PMP-kernel

Author: LeoValque

Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt

@@ -486,8 +486,8 @@ Mesh kernel: From left to right: (i) The input mesh; (ii) The kernel of the inpu
 
 
 As illustrated on \cgalFigureRef{coref_kernel_figure}, the kernel of a mesh is defined as the set of inside points from which the entire surface of the mesh is visible. More formally, a point belongs to the kernel if, for every point on the mesh, the segment connecting them lies entirely inside the mesh. Equivalently, the kernel is the intersection of the half-spaces induced by all faces of the mesh.
-The functions `CGAL::Polygon_mesh_processing::kernel()`, `CGAL::Polygon_mesh_processing::kernel_point()` and `CGAL::Polygon_mesh_processing::is_kernel_empty()` outputs respectively the full kernel, a single point inside it or
-simply whether the kernel exists.
+The functions `CGAL::Polygon_mesh_processing::kernel()`, `CGAL::Polygon_mesh_processing::kernel_point()` and `CGAL::Polygon_mesh_processing::is_kernel_empty()` output the full kernel, a single point inside it or
+a Boolean indicating whether the kernel exists or not, respectively.
 
 \subsection coref_ex_subsec Examples
 
@@ -1492,7 +1492,7 @@ preceding work. <a href="https://www.creatis.insa-lyon.fr/~valette/public/projec
 used as a reference during the project.
 The `apply_iterative_snap_rounding` option for autorefinement was implemented in 2025, by Léo Valque, based on his work with Sylvain Lazard \cgalCite{lazard:hal-04907149}.
 
-The kernel functions and the convex specialization of `CGAL::Polygon_mesh_processing::clip()` and `CGAL::Polygon_mesh_processing::refine_with_plane()` was implemented in 2025, by Léo Valque, based on the work of Nehring-Wirxel et al. \cgalCite{nehring2025meshkernel}.
+The kernel functions and the convex specialization of `CGAL::Polygon_mesh_processing::clip()` and `CGAL::Polygon_mesh_processing::refine_with_plane()` were implemented in 2025, by Léo Valque, based on the work of Nehring-Wirxel et al. \cgalCite{nehring2025meshkernel}.
 
 */
 } /* namespace CGAL */

Polygon_mesh_processing/examples/Polygon_mesh_processing/mesh_kernel_example.cpp

@@ -30,4 +30,4 @@ int main(int argc, char** argv)
   std::cout << "Output containing " << vertices(kernel).size() << " vertices wrote in " << oname << std::endl;
 
   std::ofstream("kernel.off") << kernel;
-}
+}

Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Three_point_cut_plane_traits.h

@@ -25,7 +25,7 @@ namespace Polygon_mesh_processing {
 \ingroup PMP_corefinement_grp
 
 The class `Three_point_cut_plane_traits<Kernel>` is a model of the
-TODO concept. This traits class represents planes by three defining points and supports efficient point–plane orientation and plane–line intersection operations.
+TODO concept. In this traits class, a plane is represented by a triple of non-collinear points.
 
 TODO documented or remains internal?
 
@@ -117,4 +117,4 @@ struct Three_point_cut_plane_traits
 
 } } // end of CGAL::Polygon_mesh_processing
 
-#endif // CGAL_THREE_POINT_CUT_PLANE_TRAITS_H
+#endif // CGAL_THREE_POINT_CUT_PLANE_TRAITS_H

Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/clip_convex.h

@@ -27,7 +27,7 @@ namespace internal{
 
 /**
   * Given a convex mesh and a plane, return an halfedge crossing the plane from a vertex on positive side to a vertex on the plane or the negative side.
-  * Return a null halfedge if the mesh and the plane does not intersect.
+  * Return a null halfedge if the mesh and the plane do not intersect.
   */
 template <class PolygonMesh, class NamedParameters =  parameters::Default_named_parameters>
 typename boost::graph_traits<PolygonMesh>::halfedge_descriptor

Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/kernel.h

@@ -230,8 +230,7 @@ kernel(const PolygonMesh& pm,
   *
   * The kernel is obtained by iteratively computing the intersection of the half-spaces defined by the faces of the mesh.
   *
-  * The kernel may be degenerate. If the kernel has dimension 2, the output mesh consists of a single face. If the kernel has dimension 0 or 1,
-  * the output mesh contains one or two isolate vertices, respectively.
+  * The kernel may be degenerate. If the dimension of the kernel is 2, the output mesh consists of a single face. If the dimension of the kernel is 1, the output mesh contains only two isolated vertices. If the dimension of the kernel is 0, the output mesh contains only a single isolated vertex.
   *
   * @tparam PolygonMesh a model of `MutableFaceGraph`, `HalfedgeListGraph` and `FaceListGraph`.
   *                      An internal property map for `CGAL::vertex_point_t` must be available.
@@ -265,7 +264,7 @@ kernel(const PolygonMesh& pm,
   *   \cgalParamNBegin{random_seed}
   *     \cgalParamDescription{The seed use by the shuffle option}
   *     \cgalParamType{unsigned int}
-  *     \cgalParamDefault{The seed of std::random_device()}
+  *     \cgalParamDefault{The seed of `std::random_device()`}
   *   \cgalParamNEnd
   *
   *   \cgalParamNBegin{starting_cube}
@@ -487,4 +486,4 @@ kernel_point(const PolygonMesh& pm,
 
 } } // end of CGAL::Polygon_mesh_processing
 
-#endif // CGAL_POLYGON_MESH_PROCESSING_KERNEL_H
+#endif // CGAL_POLYGON_MESH_PROCESSING_KERNEL_H