diff options
| author | Vincent Rouvreau <10407034+VincentRouvreau@users.noreply.github.com> | 2022-06-08 09:20:18 +0200 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2022-06-08 09:20:18 +0200 |
| commit | f045b0fe772e2c690d80aebcd31734700790c8a8 (patch) | |
| tree | 627e41947a1ff275c92441a8b953b829d8311d70 /src/GudhUI/utils/Furthest_point_epsilon_net.h | |
| parent | 91b21f6cfdf8e225070514c34bd6fcae296e3d52 (diff) | |
| parent | e66ad01ed9fefd2fd4584c5e7928f808e3f257f5 (diff) | |
Merge branch 'master' into feature/bug_class_diagrams
Diffstat (limited to 'src/GudhUI/utils/Furthest_point_epsilon_net.h')
| -rw-r--r-- | src/GudhUI/utils/Furthest_point_epsilon_net.h | 4 |
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) { |