no code implementations • 2 Mar 2018 • Karl Bringmann, Sergio Cabello, Michael T. M. Emmerich
It is known that the problem can be solved in polynomial time in the plane, while the best known running time in any dimension $d \ge 3$ is $\Omega\big(\binom{n}{k}\big)$.
Computational Geometry Data Structures and Algorithms F.2.2
