Editing Bounding sphere (section)

===Fischer's exact solver===
Fischer et al. (2003) proposed an exact solver, though the algorithm does not have a polynomial running time in the worst case.{{r|Fischer2003}} The algorithm is purely combinatorial and implements a pivoting scheme similar to the [[simplex method]] for [[linear programming]], used earlier in some heuristics. It starts with a large sphere that covers all points and gradually shrinks it until it cannot be shrunk further. The algorithm features correct termination rules in cases of degeneracies, overlooked by prior authors; and efficient handling of partial solutions, which produces a major speed-up. The authors verified that the algorithm is efficient in practice in low and moderately low (up to 10,000) dimensions and claim it does not exhibit numerical stability problems in its floating-point operations.{{r|Fischer2003}} A C++ implementation of the algorithm is available as an open-source project.<ref>[https://github.com/hbf/miniball miniball open-source project]</ref>