Publisher
Springer International Publishing
Reference30 articles.
1. Matoušek, J.: Lower envelopes. In: Lectures on Discrete Geometry. Graduate Texts in Mathematics, vol. 212, pp. 165–194. Springer (2002)
2. Hershberger, J.: Finding the upper envelope of
$$n$$
n
line segments in
$$O(n\log n)$$
O
(
n
log
n
)
time. Information Processing Letters 33(4), 169–174 (1989)
3. Eppstein, D.: Geometric lower bounds for parametric matroid optimization. Discrete Comput. Geom. 20(4), 463–476 (1998)
4. Fernández-Baca, D., Slutzki, G., Eppstein, D.: Using sparsification for parametric minimum spanning tree problems. Nordic J. Comput. 3(4), 352–366 (1996)
5. Agarwal, P.K., Eppstein, D., Guibas, L.J., Henzinger, M.R.: Parametric and kinetic minimum spanning trees. In: Proc. 39th IEEE Symp. Foundations of Computer Science (FOCS 1998), pp. 596–605 (1998)