A convex hull algorithm for planar simple polygons
作者：
Highlights：
•
摘要
A linear convex hull algorithm which is an improvement on the algorithm due to Sklansky is given.
论文关键词：Simple polygon,Convex hull,Algorithm
论文评审过程：Received 14 December 1982, Revised 14 January 1985, Available online 19 May 2003.
论文官网地址：https://doi.org/10.1016/0031-3203(85)90027-5
