A linear time algorithm for obtaining the convex hull of a simple polygon
作者：
Highlights：
•
摘要
In this paper, a linear time algorithm is described for finding the convex hull of a simple (i.e. non-self intersecting) polygon.
论文关键词：Convex hull algorithm,Computational complexity,Simple polygon,Convex polygon,Ordered crossing polygon
论文评审过程：Received 23 April 1982, Revised 22 April 1983, Accepted 16 May 1983, Available online 19 May 2003.
论文官网地址：https://doi.org/10.1016/0031-3203(83)90075-4
