A linear time algorithm for computing the convex hull of an ordered crossing polygon

作者：

Highlights：

•

摘要

In this paper, we describe a linear time algorithm for finding the convex hull of an ordered crossing polygon and prove its correctness.

论文关键词：Convex hull,Simple polygon,Crossing polygon,Ordered crossing polygon

论文评审过程：Received 8 June 1983, Revised 21 September 1983, Accepted 12 October 1983, Available online 19 May 2003.

论文官网地址：https://doi.org/10.1016/0031-3203(84)90086-4