FINDING THE CONVEX-HULL OF A SIMPLE POLYGON

被引:174
作者
GRAHAM, RL
YAO, FF
机构
[1] BELL TEL LABS INC,MURRAY HILL,NJ 07974
[2] XEROX CORP,PALO ALTO RES CTR,PALO ALTO,CA 94304
关键词
D O I
10.1016/0196-6774(83)90013-5
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:324 / 331
页数:8
相关论文
共 7 条
[1]   CONVEX HULL OF A FINITE SET OF POINTS IN 2 DIMENSIONS [J].
BYKAT, A .
INFORMATION PROCESSING LETTERS, 1978, 7 (06) :296-298
[2]  
Graham R. L., 1972, Information Processing Letters, V1, P132, DOI 10.1016/0020-0190(72)90045-2
[3]   LINEAR ALGORITHM FOR FINDING THE CONVEX-HULL OF A SIMPLE POLYGON [J].
MCCALLUM, D ;
AVIS, D .
INFORMATION PROCESSING LETTERS, 1979, 9 (05) :201-206
[4]  
Shamos Michael I., 1978, THESIS YALE U
[5]   MEASURING CONCAVITY ON A RECTANGULAR MOSAIC [J].
SKLANSKY, J .
IEEE TRANSACTIONS ON COMPUTERS, 1972, C 21 (12) :1355-1364
[6]  
TOUSSAINT G, 1978, 785 MCGILL U TECHN R
[7]   A LOWER BOUND TO FINDING CONVEX HULLS [J].
YAO, AC .
JOURNAL OF THE ACM, 1981, 28 (04) :780-787