COMPUTING THE GEODESIC CENTER OF A SIMPLE POLYGON

被引：51

作者：

POLLACK, R

SHARIR, M

ROTE, G

机构：

[1] TEL AVIV UNIV,SCH MATH SCI,IL-69978 TEL AVIV,ISRAEL

[2] GRAZ TECH UNIV,INST MATH,A-8010 GRAZ,AUSTRIA

来源：

DISCRETE & COMPUTATIONAL GEOMETRY | 1989年 / 4卷 / 06期

关键词：

D O I：

10.1007/BF02187751

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：611 / 626

页数：16

共 17 条

[1]

ASANO T, 1985, SOCS8532 MCGILL U TE

[2]

Chazelle B., 1982, 23rd Annual Symposium on Foundations of Computer Science, P339, DOI 10.1109/SFCS.1982.58

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

DYER, ME .

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

[4] ON A MULTIDIMENSIONAL SEARCH TECHNIQUE AND ITS APPLICATION TO THE EUCLIDEAN ONE-CENTER PROBLEM [J].

DYER, ME .

SIAM JOURNAL ON COMPUTING, 1986, 15 (03) :725-738

[5] TRIANGULATING A SIMPLE POLYGON [J].

GAREY, MR ;

JOHNSON, DS ;

PREPARATA, FP ;

TARJAN, RE .

INFORMATION PROCESSING LETTERS, 1978, 7 (04) :175-179

[6] LINEAR-TIME ALGORITHMS FOR VISIBILITY AND SHORTEST-PATH PROBLEMS INSIDE TRIANGULATED SIMPLE POLYGONS [J].

GUIBAS, L ;

HERSHBERGER, J ;

LEVEN, D ;

SHARIR, M ;

TARJAN, RE .

ALGORITHMICA, 1987, 2 (02) :209-233

[7] EUCLIDEAN SHORTEST PATHS IN THE PRESENCE OF RECTILINEAR BARRIERS [J].

LEE, DT ;

PREPARATA, FP .

NETWORKS, 1984, 14 (03) :393-410

[8]

LENHART W, 1987, 3RD P ACM S COMP GEO, P1

[9] LINEAR-TIME ALGORITHMS FOR LINEAR-PROGRAMMING IN R3 AND RELATED PROBLEMS [J].

MEGIDDO, N .

SIAM JOURNAL ON COMPUTING, 1983, 12 (04) :759-776

[10] LINEAR-PROGRAMMING IN LINEAR TIME WHEN THE DIMENSION IS FIXED [J].

MEGIDDO, N .

JOURNAL OF THE ACM, 1984, 31 (01) :114-127

← 1 2 →