summaryrefslogtreecommitdiff
path: root/src/GudhUI/utils/Furthest_point_epsilon_net.h
diff options
context:
space:
mode:
authoralbert-github <albert.tests@gmail.com>2022-05-22 17:58:57 +0200
committeralbert-github <albert.tests@gmail.com>2022-05-22 17:58:57 +0200
commita00ce1990b112aa34f72e5504ae0cfe14f11e292 (patch)
tree73e3677a69d086b67d68d522ab69d068f74ee236 /src/GudhUI/utils/Furthest_point_epsilon_net.h
parenta163623da4e350f2e9de01144d74edfab1c28f78 (diff)
Spelling corrections
A number of spelling corrections as reported by the codespell (see: https://github.com/codespell-project/codespell) program and lists. Some remarks: - not considered are grammatical errors - not considered are names in the code although there are a number that could be improved (like `childs` -> `children`) - in the documentation it could be made clearer what are variables and what is running text (e.g. by placing variables in running text between backticks) - some comments are in the French language, I think it would be better to have them in the English (United States version).
Diffstat (limited to 'src/GudhUI/utils/Furthest_point_epsilon_net.h')
-rw-r--r--src/GudhUI/utils/Furthest_point_epsilon_net.h4
1 files changed, 2 insertions, 2 deletions
diff --git a/src/GudhUI/utils/Furthest_point_epsilon_net.h b/src/GudhUI/utils/Furthest_point_epsilon_net.h
index 6eb71071..195d0014 100644
--- a/src/GudhUI/utils/Furthest_point_epsilon_net.h
+++ b/src/GudhUI/utils/Furthest_point_epsilon_net.h
@@ -27,7 +27,7 @@ template<typename SkBlComplex> class Furthest_point_epsilon_net {
/**
* Let V be the set of vertices.
- * Initially v0 is one arbitrarly vertex and the set V0 is {v0}.
+ * Initially v0 is one, arbitrary, vertex and the set V0 is {v0}.
* Then Vk is computed as follows.
* First we compute the vertex pk that is the furthest from Vk
* then Vk = Vk \cup pk.
@@ -54,7 +54,7 @@ template<typename SkBlComplex> class Furthest_point_epsilon_net {
/**
* @brief Modify complex to be the expansion of the k-nearest neighbor
- * symetric graph.
+ * symmetric graph.
*/
Furthest_point_epsilon_net(SkBlComplex& complex) :
complex_(complex) {