generic-library/opencv
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Removed non-ASCII characters from the comments

Browse Source
This commit is contained in:
Ovidiu Parvu
2013-09-19 15:12:07 +01:00
parent 73f476bd4b
commit 21390d806f
1 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
modules/imgproc/src/min_enclosing_triangle.cpp
View File

@@ -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, <EFBFBD>Finding the smallest triangles containing a given convex // [1] V. Klee and M. C. Laskowski, "Finding the smallest triangles containing a given convex
// polygon<EFBFBD>, Journal of Algorithms, vol. 6, no. 3, pp. 359<EFBFBD>375, Sep. 1985. // polygon", Journal of Algorithms, vol. 6, no. 3, pp. 359-375, Sep. 1985.
// [2] J. O<EFBFBD>Rourke, A. Aggarwal, S. Maddila, and M. Baldwin, <EFBFBD>An optimal algorithm for finding // [2] J. O'Rourke, A. Aggarwal, S. Maddila, and M. Baldwin, "An optimal algorithm for finding
// minimal enclosing triangles<EFBFBD>, Journal of Algorithms, vol. 7, no. 2, pp. 258<EFBFBD>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.