FINDING THE UPPER ENVELOPE OF N LINE SEGMENTS IN O(N LOG N) TIME

被引：183

作者：

HERSHBERGER, J

机构：

来源：

INFORMATION PROCESSING LETTERS | 1989年 / 33卷 / 04期

关键词：

D O I：

10.1016/0020-0190(89)90136-1

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：169 / 174

页数：6

共 12 条

[1]

AGARWAL P, 1987, 332 COUR I COMP SCI

[2]

ALEVIZOS P, 1988, UNPUB BOUNDARY UNION

[3] Visibility of Disjoint Polygons [J].

Asano, Takao ;

Asano, Tetsuo ;

Guibas, Leonidas ;

Hershberger, John ;

Imai, Hiroshi .

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

[4] SOME DYNAMIC COMPUTATIONAL GEOMETRY PROBLEMS [J].

ATALLAH, MJ .

COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1985, 11 (12) :1171-1181

[5] PARALLEL MERGE SORT [J].

COLE, R .

SIAM JOURNAL ON COMPUTING, 1988, 17 (04) :770-785

[6]

Davenport H., 1965, AM J MATH, V87, P684

[7] FAST ALGORITHMS FOR FINDING NEAREST COMMON ANCESTORS [J].

HAREL, D ;

TARJAN, RE .

SIAM JOURNAL ON COMPUTING, 1984, 13 (02) :338-355

[8] NONLINEARITY OF DAVENPORT SCHINZEL SEQUENCES AND OF GENERALIZED PATH COMPRESSION SCHEMES [J].

HART, S ;

SHARIR, M .

COMBINATORICA, 1986, 6 (02) :151-177

[9]

Kruskal C. P., 1985, Proceedings of the 1985 International Conference on Parallel Processing (Cat. No.85CH2140-2), P180

[10]

Preparata F. P., 2012, COMPUTATIONAL GEOMET

← 1 2 →