Finding the convex hull of a simple polygon in linear time
作者：
Highlights：
•
摘要
Though linear algorithms for finding the convex hull of a simply-connected polygon have been reported, not all are short and correct. A compact version based on Sklansky's original idea(7) and Bykat's counter-example(8) is given. Its complexity and correctness are also shown.
论文关键词：Convex hull,Linear algorithm,Computational geometry
论文评审过程：Received 8 February 1985, Revised 24 June 1985, Available online 19 May 2003.
论文官网地址：https://doi.org/10.1016/0031-3203(86)90043-9
