A counter-example to a convex hull algorithm for polygons

作者：

Highlights：

•

摘要

A linear-time algorithm was recently published (Pattern Recognition22, 561–565, 1989) for computing the convex hull of a simple polygon. In this note we present a counter-example to that algorithm.

论文关键词：Convex hull,Simple polygon,Computational geometry,Geometric complexity

论文评审过程：Received 16 October 1989, Revised 23 January 1990, Accepted 19 February 1990, Available online 19 May 2003.

论文官网地址：https://doi.org/10.1016/0031-3203(91)90087-L