On the ball spanned by balls
The procedure for linear programming in linear time in fixed dimension is extended to solve in linear time certain nonlinear problems. Examples are the problem of finding the smallest ball enclosingn given balls, and the weighted-center problem in fixed dimension.
Unable to display preview. Download preview PDF.
- [Co]R. Cole, Slowing down sorting networks to obtain faster sorting algorithms, in:Proceedings of the 25th Annual IEEE Symposium on Foundations of Computer Science (1984), IEEE Computer Society Press, Los Angeles, 1984, pp. 255–260.Google Scholar
- [PS]R. Pollack and M. Sharir, Computing the geodesic center of a simple polygon, Technical Report No. 231, Courant Institute of Mathematical Sciences, New York University, July 1986.Google Scholar