FINDING EXTREMAL POLYGONS

被引：56

作者：

BOYCE, JE

DOBKIN, DP

DRYSDALE, RL

GUIBAS, LJ

机构：

[1] PRINCETON UNIV,DEPT ELECT ENGN & COMP SCI,PRINCETON,NJ 08544

[2] XEROX CORP,PALO ALTO RES CTR,PALO ALTO,CA 94304

[3] DARTMOUTH COLL,DEPT MATH,HANOVER,NH 03755

来源：

关键词：

D O I：

10.1137/0214011

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：134 / 147

页数：14

共 12 条

[1]

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

[2] COMPLEXITY OF COMPUTATIONS UNDER VARYING SETS OF PRIMITIVES [J].

DOBKIN, DP ;

LIPTON, RJ .

[3]

DOBKIN DP, COMMUNICATION

[4]

DOLEV D, 1981, VLSI SYSTEMS COMPUTA, P143

[5]

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

[6]

Horowitz E., 1978, FUNDAMENTALS COMPUTE

[7]

IAGLOM IM, 1961, CONVEX FIGURES

[8]

Post M. J., 1981, 22nd Annual Symposium on Foundations of Computer Science, P115, DOI 10.1109/SFCS.1981.7

[9]

Santalo L. A., 1976, INTEGRAL GEOMETRY GE

[10]

SHAMOS M, 1974, UNPUB PROBLEMS COMPU