Skip to content

O
opencv
Commit 21390d80 authored by Ovidiu Parvu's avatar Ovidiu Parvu
Browse files
Options

Removed non-ASCII characters from the comments

parent 73f476bd
Hide whitespace changes
Inline Side-by-side
Showing with 4 additions and 4 deletions
modules/imgproc/src/min_enclosing_triangle.cpp
View file @ 21390d80
...@@ -20,10 +20,10 @@ ...@@ -20,10 +20,10 @@
// //
// THE IMPLEMENTATION OF THE MODULES IS BASED ON THE FOLLOWING PAPERS: // 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 // [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. // 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 // [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. // 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 // The overall complexity of the algorithm is theta(n) where "n" represents the number
// of vertices in the convex polygon. // of vertices in the convex polygon.
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment