From 27aaaa6a6b2b9a23137a9887d53fe7931854996c Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Mon, 13 Jan 2025 14:41:00 +0000
Subject: [PATCH] typo

---
 .../Vector_graphics_on_surfaces/locally_shortest_path.h     | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/Vector_graphics_on_surfaces/include/CGAL/Vector_graphics_on_surfaces/locally_shortest_path.h b/Vector_graphics_on_surfaces/include/CGAL/Vector_graphics_on_surfaces/locally_shortest_path.h
index faf5183b2cb..d9722d4af5f 100644
--- a/Vector_graphics_on_surfaces/include/CGAL/Vector_graphics_on_surfaces/locally_shortest_path.h
+++ b/Vector_graphics_on_surfaces/include/CGAL/Vector_graphics_on_surfaces/locally_shortest_path.h
@@ -3371,7 +3371,7 @@ trace_geodesic_polygon(const CGAL::Polygon_mesh_processing::Face_location<Triang
 
 /*!
  * \ingroup VGSFunctions
- * computes for each vertex of each polygon in `polygons` a face locations on `tmesh`, `center` representing the center of the 2D bounding box of the polygons.
+ * computes for each vertex of each polygon in `polygons` a face location on `tmesh`, `center` representing the center of the 2D bounding box of the polygons.
  * This method computes the location of the center of the bounding box of each polygon on the mesh with respect to `center` and calls `trace_geodesic_polygon()` with that center with
  * appropriate directions and distances to have a consistent orientation for the polygons.
  * \tparam TriangleMesh a model of `FaceListGraph` and `EdgeListGraph`
@@ -3472,7 +3472,7 @@ trace_geodesic_polygons(const CGAL::Polygon_mesh_processing::Face_location<Trian
 
 /*!
  * \ingroup VGSFunctions
- * computes for each vertex of each polygon in `polygons` a face locations on `tmesh`, `center` representing the center of the 2D bounding box of the polygons.
+ * computes for each vertex of each polygon in `polygons` a face location on `tmesh`, `center` representing the center of the 2D bounding box of the polygons.
  * This method starts by considering the segment splitting in two halves along the y-axis the bounding box of the polygons. 2D centers for each polygon are
  * computed on this segment as the intersection with the line splitting the bounding box of the polygon in two halves along the x-axis.
  * The splitting segment is then drawn on `tmesh` and the face location of the 2D centers is found.
@@ -3740,7 +3740,7 @@ FT path_length(const std::vector<CGAL::Polygon_mesh_processing::Edge_location<Tr
 
 /*!
  * \ingroup VGSFunctions
- * computes for each vertex of each polygon in `polygons` a face locations on `tmesh` along the curve `supporting_curve`.
+ * computes for each vertex of each polygon in `polygons` a face location on `tmesh` along the curve `supporting_curve`.
  * This method starts by considering the segment splitting in two halves along the y-axis the bounding box of the polygons. 2D centers for each polygon are
  * computed on this segment as the intersection with the line splitting the bounding box of the polygon in two halves along the x-axis.
  * The splitting segment is then mapped onto `supporting_curve` by first scaling it using `scaling`, and using `padding` and `is_centered`.