A Linear Algorithm for Finding the Convex Hull of a Simple Polygon
暂无分享,去创建一个
The problem of determining the convex hull of a set of n points in the plane has recently received a good deal of attention. Several algorithms for the general problem with worst case complexity D(n log n) have appeared (e.g., [3,4,6]). The special case where the points form the vertices of a simple polygon has long been considered easier. Indeed, Sklansky [S] has proposed an O(n) algorithm, but a. recently published counter example of Bykat [2] shows that the algorithm can sometimes fail. A slightly different counterexample can be constructed for a similar algorithm of Shamos [4]. In this note we present and prove the validity of a new linear time algorithm for this problem.
[1] Jack Sklansky,et al. Measuring Concavity on a Rectangular Mosaic , 1972, IEEE Transactions on Computers.
[2] A. Bykat,et al. Convex Hull of a Finite Set of Points in Two Dimensions , 1978, Inf. Process. Lett..
[3] Ronald L. Graham,et al. An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set , 1972, Inf. Process. Lett..