COMPUTING CIRCULAR SEPARABILITY

被引：41

作者：

OROURKE, J

KOSARAJU, SR

MEGIDDO, N

机构：

[1] IBM CORP,ALMADEN RES CTR,SAN JOSE,CA 95120

[2] TEL AVIV UNIV,IL-69978 TEL AVIV,ISRAEL

来源：

DISCRETE & COMPUTATIONAL GEOMETRY | 1986年 / 1卷 / 02期

关键词：

D O I：

10.1007/BF02187688

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：105 / 113

页数：9

共 18 条

[1]

CLARKSON KL, 1986, IN PRESS INFO PROC L

[2] THE COMPLEXITY OF LINEAR-PROGRAMMING [J].

DOBKIN, DP ;

REISS, SP .

THEORETICAL COMPUTER SCIENCE, 1980, 11 (01) :1-18

[3]

DOBKIN DP, 1983, THEORETICAL COMPUTER, V17, P241

[4] LINEAR TIME ALGORITHMS FOR 2-VARIABLE AND 3-VARIABLE LINEAR-PROGRAMS [J].

DYER, ME .

SIAM JOURNAL ON COMPUTING, 1984, 13 (01) :31-45

[5]

DYER ME, 1985, UNPUB MULTIDIMENSION

[6] FINDING EXTREME-POINTS IN 3-DIMENSIONS AND SOLVING THE POST-OFFICE PROBLEM IN THE PLANE [J].

EDELSBRUNNER, H ;

MAURER, HA .

INFORMATION PROCESSING LETTERS, 1985, 21 (01) :39-47

[7]

EDELSBRUNNER H, 1985, JUN P ACM S COMP GEO, P251

[8]

FISK S, 1986, IN PRESS IEEE T PAMI

[9]

Kim C. E., 1984, 16 ANN ACM S THEOR C, P117

[10] OPTIMAL SEARCH IN PLANAR SUBDIVISIONS [J].

KIRKPATRICK, D .

SIAM JOURNAL ON COMPUTING, 1983, 12 (01) :28-35

← 1 2 →