COMPUTING GEODESIC FURTHEST NEIGHBORS IN SIMPLE POLYGONS

被引：35

作者：

SURI, S ^{[1
]}

机构：

[1] JOHNS HOPKINS UNIV,BALTIMORE,MD 21218

来源：

JOURNAL OF COMPUTER AND SYSTEM SCIENCES | 1989年 / 39卷 / 02期

关键词：

D O I：

10.1016/0022-0000(89)90045-7

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：220 / 235

页数：16

共 12 条

[1]

AGGARWAL A, 1986, 2ND P ACM S COMP GEO, P285

[2]

ASANO T, 1986 P US JAP SEM CO

[3]

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

[4] TRIANGULATING A SIMPLE POLYGON [J].

GAREY, MR ;

JOHNSON, DS ;

PREPARATA, FP ;

TARJAN, RE .

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

[5] 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

[6] GEODESIC METHODS IN QUANTITATIVE IMAGE-ANALYSIS [J].

LANTUEJOUL, C ;

MAISONNEUVE, F .

PATTERN RECOGNITION, 1984, 17 (02) :177-187

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

LEE, DT ;

PREPARATA, FP .

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

[8]

POLLACK R, 1986, 231 NEW YORK U COUR

[9]

Preparata F. P., 2012, COMPUTATIONAL GEOMET

[10] AN O(N-LOG LOG-N)-TIME ALGORITHM FOR TRIANGULATING A SIMPLE POLYGON [J].

TARJAN, RE ;

VANWYK, CJ .

SIAM JOURNAL ON COMPUTING, 1988, 17 (01) :143-178

← 1 2 →