Finding the upper envelope of n line segments in O(n log n) time
- 21 December 1989
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 33 (4) , 169-174
- https://doi.org/10.1016/0020-0190(89)90136-1
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Parallel Merge SortSIAM Journal on Computing, 1988
- Planar realizations of nonlinear davenport-schinzel sequences by segmentsDiscrete & Computational Geometry, 1988
- Visibility of disjoint polygonsAlgorithmica, 1986
- Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemesCombinatorica, 1986
- Some dynamic computational geometry problemsComputers & Mathematics with Applications, 1985
- Fast Algorithms for Finding Nearest Common AncestorsSIAM Journal on Computing, 1984
- Finding the maximum, merging, and sorting in a parallel computation modelJournal of Algorithms, 1981
- A Combinatorial Problem Connected with Differential EquationsAmerican Journal of Mathematics, 1965