CONVEX HULLS OF FINITE SETS OF POINTS IN 2 AND 3 DIMENSIONS

被引：444

作者：

PREPARATA, FP

HONG, SJ

机构：

[1] UNIV ILLINOIS,COORDINATED SCI LAB,URBANA,IL 61801

[2] IBM CORP,SYST PROD DIV,POUGHKEEPSIE,NY 12602

来源：

COMMUNICATIONS OF THE ACM | 1977年 / 20卷 / 02期

关键词：

D O I：

10.1145/359423.359430

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：87 / 93

页数：7

共 10 条

[1]

AHO AV, 1974, DESIGN ANALYSIS COMP

[2] AN ALGORITHM FOR CONVEX POLYTOPES [J].

CHAND, DR ;

KAPUR, SS .

JOURNAL OF THE ACM, 1970, 17 (01) :78-&

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

FREEMAN, H ;

SHAPIRA, R .

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

[4] STEINER MINIMAL TREES [J].

GILBERT, EN ;

POLLAK, HO .

SIAM JOURNAL ON APPLIED MATHEMATICS, 1968, 16 (01) :1-&

[5]

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

[6]

Grunbaum B, 1967, CONVEX POLYTOPES

[7] FINDING MAXIMA OF A SET OF VECTORS [J].

KUNG, HT ;

LUCCIO, F ;

PREPARATA, FP .

JOURNAL OF THE ACM, 1975, 22 (04) :469-476

[8]

Shamos M.I, 1975, PROBLEMS COMPUTATION

[9] MEASURING CONCAVITY ON A RECTANGULAR MOSAIC [J].

SKLANSKY, J .

IEEE TRANSACTIONS ON COMPUTERS, 1972, C 21 (12) :1355-1364

[10]

YAO FF, 1974, FINDING MAXIMAL ELEM

← 1 →