EFFICIENT ALGORITHMS FOR COMPUTING THE MAXIMUM DISTANCE BETWEEN 2 FINITE PLANAR SETS

被引：13

作者：

BHATTACHARYA, BK

TOUSSAINT, GT

机构：

来源：

JOURNAL OF ALGORITHMS | 1983年 / 4卷 / 02期

关键词：

D O I：

10.1016/0196-6774(83)90040-8

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：121 / 136

页数：16

共 25 条

[1]

AKL SG, 1978, FAST ALGORITHM PLANA

[2]

AKL SG, 1978, 4TH P INT JOINT C PA, P483

[3]

AVIS D, 1980, OCT P ALL C URB, P35

[4] AVERAGE NUMBER OF MAXIMA IN A SET OF VECTORS AND APPLICATIONS [J].

BENTLEY, JL ;

KUNG, HT ;

SCHKOLNICK, M ;

THOMPSON, CD .

JOURNAL OF THE ACM, 1978, 25 (04) :536-543

[5] APPROXIMATION ALGORITHMS FOR CONVEX HULLS [J].

BENTLEY, JL ;

FAUST, MG ;

PREPARATA, FP .

COMMUNICATIONS OF THE ACM, 1982, 25 (01) :64-68

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

BENTLEY, JL ;

SHAMOS, MI .

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

[7]

BHATTACHARYA BK, 1981, SOCS8140 MCGILL U SC

[8]

DEVROYE L, 1980, INFORM PROCESS LETT, V11, P53, DOI 10.1016/0020-0190(80)90036-8

[9]

Devroye L., 1981, Computer Science and Statistics: Proceedings of the 13th Symposium on the Interface, P76

[10] A NOTE ON LINEAR EXPECTED TIME ALGORITHMS FOR FINDING CONVEX HULLS [J].

DEVROYE, L ;

TOUSSAINT, GT .

COMPUTING, 1981, 26 (04) :361-366

← 1 2 3 →