From 21390d806ff0071e7ccdb752219035537b527003 Mon Sep 17 00:00:00 2001 From: Ovidiu Parvu Date: Thu, 19 Sep 2013 15:12:07 +0100 Subject: [PATCH] Removed non-ASCII characters from the comments --- modules/imgproc/src/min_enclosing_triangle.cpp | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/modules/imgproc/src/min_enclosing_triangle.cpp b/modules/imgproc/src/min_enclosing_triangle.cpp index fdc0073a5d..0c9d23bb35 100644 --- a/modules/imgproc/src/min_enclosing_triangle.cpp +++ b/modules/imgproc/src/min_enclosing_triangle.cpp @@ -20,10 +20,10 @@ // // THE IMPLEMENTATION OF THE MODULES IS BASED ON THE FOLLOWING PAPERS: // -// [1] V. Klee and M. C. Laskowski, “Finding the smallest triangles containing a given convex -// polygon”, Journal of Algorithms, vol. 6, no. 3, pp. 359–375, Sep. 1985. -// [2] J. O’Rourke, A. Aggarwal, S. Maddila, and M. Baldwin, “An optimal algorithm for finding -// minimal enclosing triangles”, Journal of Algorithms, vol. 7, no. 2, pp. 258–269, Jun. 1986. +// [1] V. Klee and M. C. Laskowski, "Finding the smallest triangles containing a given convex +// polygon", Journal of Algorithms, vol. 6, no. 3, pp. 359-375, Sep. 1985. +// [2] J. O'Rourke, A. Aggarwal, S. Maddila, and M. Baldwin, "An optimal algorithm for finding +// minimal enclosing triangles", Journal of Algorithms, vol. 7, no. 2, pp. 258-269, Jun. 1986. // // The overall complexity of the algorithm is theta(n) where "n" represents the number // of vertices in the convex polygon.