A NEW LINEAR CONVEX-HULL ALGORITHM FOR SIMPLE POLYGONS

被引：18

作者：

BHATTACHARYA, BK ^{[1
]}

ELGINDY, H ^{[1
]}

机构：

[1] MCGILL UNIV,SCH COMP SCI,MONTREAL H3A 2K6,QUEBEC,CANADA

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1984年 / 30卷 / 01期

关键词：

D O I：

10.1109/TIT.1984.1056845

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：85 / 88

页数：4

共 19 条

[1] FAST CONVEX HULL ALGORITHM [J].

AKL, SG ;

TOUSSAINT, GT .

INFORMATION PROCESSING LETTERS, 1978, 7 (05) :219-222

[2] ON THE MULTIMODALITY OF DISTANCES IN CONVEX POLYGONS [J].

AVIS, D ;

TOUSSAINT, GT ;

BHATTACHARYA, BK .

COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1982, 8 (02) :153-156

[3] DIVIDE AND CONQUER FOR LINEAR EXPECTED TIME [J].

BENTLEY, JL ;

SHAMOS, MI .

INFORMATION PROCESSING LETTERS, 1978, 7 (02) :87-91

[4]

BHATTACHARYA BK, UNPUB DETERMINATION

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

BYKAT, A .

INFORMATION PROCESSING LETTERS, 1978, 7 (06) :296-298

[6]

DOBKIN DP, 1979, 20TH ANN IEEE S F CO

[7] DETERMINING MINIMUM-AREA ENCASING RECTANGLE FOR AN ARBITRARY CLOSED CURVE [J].

FREEMAN, H ;

SHAPIRA, R .

COMMUNICATIONS OF THE ACM, 1975, 18 (07) :409-413

[8]

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

[9]

LEE DT, 1980, 8003FC01 NW U TECH R

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

MCCALLUM, D ;

AVIS, D .

INFORMATION PROCESSING LETTERS, 1979, 9 (05) :201-206

← 1 2 →