Related research questions

[tschm]

No description provided.

[tschm]

• Experimental research on the asymptotic behaviour of this algorithm

  Welzl claims he has an O(n) algorithm where n is the number of points. How are we doing?

• Can we write a super fast version for three points?

  We could probably do something with cp.Parameter here. Such small problems are at the core of Welzl but there they are using the circumcircle rather the optimal minimum enclosing circle

• We use a Second Order Cone program. Can we do better with some first order?

• Compare with more naive implementations of cvxpy, e.g. loops where we say constraints = cp.norm(center - p) for p in points

• Implement Welzl in RUST