AN OPTIMAL VISIBILITY GRAPH ALGORITHM FOR TRIANGULATED SIMPLE POLYGONS

被引：62

作者：

HERSHBERGER, J

机构：

来源：

ALGORITHMICA | 1989年 / 4卷 / 01期

关键词：

D O I：

10.1007/BF01553883

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：141 / 155

页数：15

共 14 条

[1]

[Anonymous], P 1 ACM S COMP GEOM

[2] Visibility of Disjoint Polygons [J].

Asano, Takao ;

Asano, Tetsuo ;

Guibas, Leonidas ;

Hershberger, John ;

Imai, Hiroshi .

ALGORITHMICA, 1986, 1 (1-4) :49-63

[3]

Baumgart B.G., 1975, AFIPS 75, P589

[4] TRIANGULATION AND SHAPE-COMPLEXITY [J].

CHAZELLE, B ;

INCERPI, J .

ACM TRANSACTIONS ON GRAPHICS, 1984, 3 (02) :135-152

[5] TRIANGULATING A SIMPLE POLYGON [J].

GAREY, MR ;

JOHNSON, DS ;

PREPARATA, FP ;

TARJAN, RE .

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

[6]

Ghosh S. K., 1987, 28th Annual Symposium on Foundations of Computer Science (Cat. No.87CH2471-1), P11, DOI 10.1109/SFCS.1987.6

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

[8] PRIMITIVES FOR THE MANIPULATION OF GENERAL SUBDIVISIONS AND THE COMPUTATION OF VORONOI DIAGRAMS [J].

GUIBAS, L ;

STOLFI, J .

ACM TRANSACTIONS ON GRAPHICS, 1985, 4 (02) :74-123

[9]

Guibas Leo J., 1977, NEW REPRESENTATION L, P49, DOI [10.1145/800105.803395, DOI 10.1145/800105.803395]

[10]

Hertel S., 1983, P C F COMPUTING THEO, P207

← 1 2 →