Computational Geometry Column 29

, 1993. [Sha94] M. Sharir. Almost tight upper bounds for lower envelopes in higher dimensions. Discrete Comput. Geom., 12:327--345, 1994. [SS83] J. T. Schwartz and M. Sharir. On the "piano movers" problem II: general techniques for computing topological properties of real algebraic manifolds. Adv. Appl. Math., 4:298--351, 1983. (Written 30 July 1996) [AS95] P. K. Agarwal and M. Sharir. Davenport-Schinzel Sequences and Their Geometric Applications. Cambridge University Press, Cambridge, UK, 1995. [Bal95] I. Balaban. An optimal algorithm for finding segments intersections. In Proc. of the 11th Symp. on Comput. Geom., pages 211--219, Vancouver, BC, Canada, June 1995. ACM Press. [Bro79] K. Q. Brown. Voronoi diagrams from convex hulls. Inform. Process. Lett., 9:223--228, 1979. [Can87] J. Canny. The Complexity of Robot Motion Planning. MIT Press, Cambridge, MA, 1987. [CE92] B. Chazelle and H. Edelsb