songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Fix capitalization

This commit is contained in:
Simon Giraudot 2020-03-24 16:32:46 +01:00
parent 6d52e3307e
commit 3b8c8f200e
2 changed files with 5 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
BGL/doc/BGL/BGL.txt
View File

@ -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:

2
BGL/include/CGAL/boost/graph/selection.h
View File

@ -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.