Function ncollide2df64::narrow::algorithm::minkowski_sampling::closest_points
pub fn closest_points<S: Simplex<AnnotatedPoint>, G1: Implicit<V, M> + PreferedSamplingDirections<V, M>, G2: Implicit<V, M> + PreferedSamplingDirections<V, M>>(m1: &M, g1: &G1, m2: &M, g2: &G2, simplex: &mut S) -> Option<(V, V)>
Computes the closest points between two implicit inter-penetrating shapes. Returns None if the shapes are not in penetration. This can be used as a fallback algorithm for the GJK algorithm.