FINDING THE SMALLEST TRIANGLES CONTAINING A GIVEN CONVEX POLYGON

被引：40

作者：

KLEE, V

LASKOWSKI, MC

机构：

[1] UNIV WASHINGTON,DEPT MATH,SEATTLE,WA 98195

[2] UNIV CALIF BERKELEY,DEPT MATH,BERKELEY,CA 94720

来源：

关键词：

D O I：

10.1016/0196-6774(85)90005-7

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：359 / 375

页数：17

共 13 条

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

AVIS, D ;

TOUSSAINT, GT ;

BHATTACHARYA, BK .

[2]

BOYCE JE, 1982, 14TH P ANN AMC S THE

[3]

Chazelle B., 1983, 24th Annual Symposium on Foundations of Computer Science, P217, DOI 10.1109/SFCS.1983.75

[4]

Dobkin D. P., 1979, 20th Annual Symposium of Foundations of Computer Science, P9, DOI 10.1109/SFCS.1979.28

[5]

DOBKIN DP, ADV COMPUT RES

[6]

DOBKIN DP, J ALGORITHMS

[7]

Edelsbrunner H., 1983, 24th Annual Symposium on Foundations of Computer Science, P83, DOI 10.1109/SFCS.1983.11

[8]

EDELSBRUNNER H, 1982, F98 TU GRAZ I INF PR

[9]

KIRKPATRICK DG, 1982, 20TH P ANN ALL C COM, P35

[10]

OROURKE J, UNPUB J ALGORITHMS