Rating changes for last rounds are temporarily rolled back. They will be returned soon. ×

O(n) algorithm for finding largest triangle in a convex is wrong?

Revision en1, by u0qyz1234, 2017-06-02 20:35:01

Given a convex polygon P, find the largest-area inscribed triangle is a very classical problem.

It's well known that it can be solved by rotating calipers in O(n) complexity.

But this paper said, the technique rotating calipers was found to be incorrect.

So confused.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English u0qyz1234 2017-06-02 20:35:01 384 Initial revision (published)