Polygon Convexity: A Minimal O(n) Test
计算几何
2007-05-23 v1 计算复杂性
组合数学
度量几何
摘要
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.
引用
@article{arxiv.cs/0609141,
title = {Polygon Convexity: A Minimal O(n) Test},
author = {Iosif Pinelis},
journal= {arXiv preprint arXiv:cs/0609141},
year = {2007}
}
备注
14 pages