Finding the upper envelope of n line segments in O(n log n) time

Agarwal, 1987, Sharp upper and lower bounds for the length of general Davenport-Schinzel sequences

Alevizos, 1988, On the boundary of a union of rays

Asano, 1986, Visibility of disjoint polygons, Algorithmica, 1, 49, 10.1007/BF01840436

Atallah, 1985, Some dynamic computational geometry problems, Comput. Math. Appl., 11, 1171, 10.1016/0898-1221(85)90105-1

Cole, 1988, Parallel merge sort, SIAM J. Comput., 17, 770, 10.1137/0217049

Davenport, 1965, A combinatorial problem connected with differential equations, Amer. J. Math., 87, 684, 10.2307/2373068

Harel, 1984, Fast algorithms for finding nearest common ancestors, SIAM J. Comput., 13, 338, 10.1137/0213024

Hart, 1986, Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes, Combinatorica, 6, 151, 10.1007/BF02579170

Kruskal, 1985, The power of parallel prefix, Proc. IEEE International Conference on Parallel Processing, 180

Preparata, 1985

Shiloach, 1981, Finding the maximum, merging, and sorting in a parallel computation model, J. Algorithms, 2, 88, 10.1016/0196-6774(81)90010-9

Wiernik, 1988, Planar realization of nonlinear Davenport-Schinzel sequences by segments, Discrete Comput. Geometry, 3, 15, 10.1007/BF02187894