ON FINDING THE CONVEX-HULL OF A SIMPLE POLYGON

被引：65

作者：

LEE, DT

机构：

来源：

INTERNATIONAL JOURNAL OF COMPUTER & INFORMATION SCIENCES | 1983年 / 12卷 / 02期

关键词：

D O I：

10.1007/BF00993195

中图分类号：

G25 [图书馆学、图书馆事业]; G35 [情报学、情报工作];

学科分类号：

1205 ; 120501 ;

摘要：

引用

页码：87 / 98

页数：12

共 16 条

[1] FAST CONVEX HULL ALGORITHM [J].

AKL, SG ;

TOUSSAINT, GT .

[2] ANOTHER EFFICIENT ALGORITHM FOR CONVEX HULLS IN 2 DIMENSIONS [J].

ANDREW, AM .

[3]

AVIS D, 1979, SOCS792 MCGILL U SCH

[4] CONVEX HULL OF A FINITE SET OF POINTS IN 2 DIMENSIONS [J].

BYKAT, A .

[5]

Eddy W. F., 1977, ACM Transactions on Mathematical Software, V3, P398, DOI 10.1145/355759.355766

[6]

Graham R. L., 1972, Information Processing Letters, V1, P132, DOI 10.1016/0020-0190(72)90045-2

[7]

GRAHAM RL, UNPUB J ALGORITHMS

[8] ALL NEAREST-NEIGHBOR PROBLEM FOR CONVEX POLYGONS [J].

LEE, DT ;

PREPARATA, FP .

[9] LINEAR ALGORITHM FOR FINDING THE CONVEX-HULL OF A SIMPLE POLYGON [J].

MCCALLUM, D ;

AVIS, D .

[10]

OROURKE J, COMMUNICATION