Hello,
Is there an algorithm that takes in a set of ellipses and gives back and ellipse that encloses the set?
Hello, Is there an algorithm that takes in a set of ellipses and gives back and ellipse that encloses the set? 


I don't think the problem of finding a minimum area ellipse enclosing other ellipses (one interpretation of the question) is as straightforward as it might appear. I believe it can be solved in polynomial time via convex optimization, but that might be a heavy hammer, depending on resource constraints. A good hook into the literature on the topic can be found in this paper:



Here is a link to semidefinite programming code for solving this type of problem (for ellipsoids): 

