Polygon Convexity: A Minimal O(n) Test
Computational Geometry
2007-05-23 v1 Computational Complexity
Combinatorics
Metric Geometry
Abstract
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.
Keywords
Cite
@article{arxiv.cs/0609141,
title = {Polygon Convexity: A Minimal O(n) Test},
author = {Iosif Pinelis},
journal= {arXiv preprint arXiv:cs/0609141},
year = {2007}
}
Comments
14 pages