LINEAR-TIME ALGORITHMS FOR VISIBILITY AND SHORTEST-PATH PROBLEMS INSIDE TRIANGULATED SIMPLE POLYGONS

被引：311

作者：

GUIBAS, L

HERSHBERGER, J

LEVEN, D

SHARIR, M

TARJAN, RE

机构：

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

[2] NYU,COURANT INST MATH SCI,NEW YORK,NY 10012

[3] PRINCETON UNIV,DEPT COMP SCI,PRINCETON,NJ 08544

[4] AT&T BELL LABS,MURRAY HILL,NJ 07974

[5] DEC SRC,PALO ALTO,CA 94301

来源：

ALGORITHMICA | 1987年 / 2卷 / 02期

关键词：

D O I：

10.1007/BF01840360

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：209 / 233

页数：25

共 33 条

[1]

[Anonymous], P 1 ACM S COMP GEOM

[2]

ASANO T, UNPUB EFFICIENT ALGO

[3]

AVIS D, 1981, IEEE T COMPUT, V30, P910, DOI 10.1109/TC.1981.1675729

[4]

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

[5]

CHAZELLE B, UNPUB DISCRETE COMPU

[6]

EDELSBRUNNER H, 1984, DECSRC2 TECHN REP

[7] A LINEAR ALGORITHM FOR COMPUTING THE VISIBILITY POLYGON FROM A POINT [J].

ELGINDY, H ;

AVIS, D .

JOURNAL OF ALGORITHMS, 1981, 2 (02) :186-197

[8]

ELGINDY H, 1985, THESIS MCGILL U

[9]

ELGINDY HA, 1984, UNPUB EFFICIENT ALGO

[10] SHORT PROOF OF CHVATAL-WATCHMAN THEOREM [J].

FISK, S .

JOURNAL OF COMBINATORIAL THEORY SERIES B, 1978, 24 (03) :374-374

← 1 2 3 4 →