Given N points in a 3D space, how to find the smallest sphere that contains these N points?

Question

Given N points in a 3D space, how to find the smallest sphere that contains these N points?

Answer 1

The problem boils down to finding the convex hull of the N points. Most of the convex hull algorithms like divide and conquer, gift wrapping or Jarvis March and Timothy Chan's algorithms can be applied to 3D too. Of all these algorithms Timothy Chan's algorithm is the best algorithm known.