ANOTHER EFFICIENT ALGORITHM FOR CONVEX HULLS IN 2 DIMENSIONS

被引:282
作者
ANDREW, AM
机构
[1] Department of Cybernetics, University of Reading, Reading, England
关键词
Convex hull;
D O I
10.1016/0020-0190(79)90072-3
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
[No abstract available]
引用
收藏
页码:216 / 219
页数:4
相关论文
共 12 条
[1]  
Akl, Two remarks on a convex hull algorithm, Information Processing Letters, 8, pp. 108-109, (1974)
[2]  
Anderson, A reevaluation of an efficient algorithm for determining the convex hull of a finite planar set, Information Processing Lett., 7, pp. 53-55, (1978)
[3]  
Bentley, Shamos, Divide and conquer for linear expected time, Information Processing Lett., 7, pp. 87-91, (1978)
[4]  
Bykat, Convex hull of a finite set of points in two dimensions, Information Processing Lett., 7, pp. 296-298, (1978)
[5]  
Eddy, A new convex hull algorithm for planar sets, ACM Transactions on Mathematical Software, 3, pp. 398-403, (1977)
[6]  
Eddy, Algorithm 523 Convex, ACM Transactions on Mathematical Software, 3, pp. 411-412, (1977)
[7]  
Fournier, Comments on convex hull of a finite set of points in two dimensions, Information Processing Lett., 8, (1979)
[8]  
Graham, An efficient algorithm for determining the convex hull of a finite planar set, Information Processing Lett., 1, pp. 132-133, (1972)
[9]  
Green, Silverman, Constructing the convex hull of a set of points in the plane, Comput. J., 22, pp. 262-266, (1979)
[10]  
Jarvis, On the identification of the convex hull of a finite set of points in the plane, Information Processing Lett., 2, pp. 18-21, (1973)