Polygon Convexity: A Minimal O(n) Test
Pinelis, Iosif
Computational Geometry
Computational Complexity
Combinatorics
Metric Geometry
I.3.5; F.2.2; G.2.1; G.2.2
Original · EN
An O(n) test for polygon convexity is stated and proved. It is also proved that the test is minimal in a certain exact sense.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.