论文信息 - A convex hull algorithm for planar simple polygons - 字舞流文

A convex hull algorithm for planar simple polygons

Abstract A linear convex hull algorithm which is an improvement on the algorithm due to Sklansky is given.

Marian Orlowski

[1] David Avis,et al. A Linear Algorithm for Finding the Convex Hull of a Simple Polygon , 1979, Inf. Process. Lett..

[2] Jack Sklansky,et al. Measuring Concavity on a Rectangular Mosaic , 1972, IEEE Transactions on Computers.

[3] Godfried T. Toussaint,et al. On a convex hull algorithm for polygons and its application to triangulation problems , 1982, Pattern Recognit..