From 72debee12504713bb3a03b259a6754e830a4f96a Mon Sep 17 00:00:00 2001 From: mohawk2 Date: Wed, 25 May 2022 15:23:10 +0100 Subject: [PATCH] typo: Minkowsky is actually Minkowski --- modules/flann/include/opencv2/flann.hpp | 2 +- modules/flann/include/opencv2/flann/dist.h | 2 +- 2 files changed, 2 insertions(+), 2 deletions(-) diff --git a/modules/flann/include/opencv2/flann.hpp b/modules/flann/include/opencv2/flann.hpp index 5c52bfeeb5..049685aecb 100644 --- a/modules/flann/include/opencv2/flann.hpp +++ b/modules/flann/include/opencv2/flann.hpp @@ -116,7 +116,7 @@ cv::flann::L2 - Squared Euclidean distance functor, optimized version. cv::flann::L1 - Manhattan distance functor, optimized version. -cv::flann::MinkowskiDistance - The Minkowsky distance functor. +cv::flann::MinkowskiDistance - The Minkowski distance functor. This is highly optimised with loop unrolling. The computation of squared root at the end is omitted for efficiency. diff --git a/modules/flann/include/opencv2/flann/dist.h b/modules/flann/include/opencv2/flann/dist.h index 608f8a507a..2d7cbf13de 100644 --- a/modules/flann/include/opencv2/flann/dist.h +++ b/modules/flann/include/opencv2/flann/dist.h @@ -375,7 +375,7 @@ struct MinkowskiDistance MinkowskiDistance(int order_) : order(order_) {} /** - * Compute the Minkowsky (L_p) distance between two vectors. + * Compute the Minkowski (L_p) distance between two vectors. * * This is highly optimised, with loop unrolling, as it is one * of the most expensive inner loops.