A linear algorithm for finding the convex hull of a simple polygon
作者： Duncan McCallum , David Avis
DOI: 10.1016/0020-0190(79)90069-3
关键词:
摘要:
elsevier.com
sci-hub.se 参考文章(3)
R.L. Graham, An efficient algorith for determining the convex hull of a finite planar set Information Processing Letters. ,vol. 1, pp. 132- 133 ,(1972) , 10.1016/0020-0190(72)90045-2
A. Bykat, Convex hull of a finite set of points in two dimensions Information Processing Letters. ,vol. 7, pp. 296- 298 ,(1978) , 10.1016/0020-0190(78)90021-2
J. Sklansky, Measuring Concavity on a Rectangular Mosaic IEEE Transactions on Computers. ,vol. C-21, pp. 1355- 1364 ,(1972) , 10.1109/T-C.1972.223507