From 3b8c8f200e86ffc718ff820ac974b2bc9b8dc447 Mon Sep 17 00:00:00 2001
From: Simon Giraudot <simon.giraudot@geometryfactory.com>
Date: Tue, 24 Mar 2020 16:32:46 +0100
Subject: [PATCH] Fix capitalization

---
 BGL/doc/BGL/BGL.txt                      | 9 ++++-----
 BGL/include/CGAL/boost/graph/selection.h | 2 +-
 2 files changed, 5 insertions(+), 6 deletions(-)

diff --git a/BGL/doc/BGL/BGL.txt b/BGL/doc/BGL/BGL.txt
index 58c610d4718..de263e888a3 100644
--- a/BGL/doc/BGL/BGL.txt
+++ b/BGL/doc/BGL/BGL.txt
@@ -727,8 +727,7 @@ X  OOO
 
 Manually selecting faces on a triangle mesh may create irregular
 borders (sawtooth) because of the shape of the triangles. Such borders
-can be regularized using the Alpha Expansion
-algorithm.
+can be regularized using the alpha expansion algorithm.
 
 \cgal provides a function `CGAL::regularize_face_selection_borders()`
 to apply this algorithm to the borders of a face selection on a
@@ -736,13 +735,13 @@ to apply this algorithm to the borders of a face selection on a
 function affects a selection depending on the parameters.
 
 \cgalFigureBegin{regularization_fig, regularize_selection.png}
-Regularization of Face Selection Borders using Alpha
-Expansion. Different outputs are shown for different weight
+Regularization of Face Selection Borders using alpha
+expansion. Different outputs are shown for different weight
 parameters, with and without preventing unselection.
 \cgalFigureEnd
 
 
-The following example shows how to apply this Alpha Expansion
+The following example shows how to apply this alpha expansion
 regularization to the borders of a face selection of a
 `CGAL::Surface_mesh` object:
   
diff --git a/BGL/include/CGAL/boost/graph/selection.h b/BGL/include/CGAL/boost/graph/selection.h
index 04d357f723e..b02362525bd 100644
--- a/BGL/include/CGAL/boost/graph/selection.h
+++ b/BGL/include/CGAL/boost/graph/selection.h
@@ -430,7 +430,7 @@ reduce_face_selection(
   regularizes a selection in order to minimize the length of the
   border of the selection.
 
-  The Alpha Expansion algorithm is used (see
+  The alpha expansion algorithm is used (see
   `CGAL::alpha_expansion_graphcut()`) using the length of the edge
   between two faces as the edge cost and the initial
   selected/unselected property of a face as the face cost.